Traced communication complexity of cellular automata

DOI10.1016/J.TCS.2011.02.025zbMath1216.68173arXiv1102.3522OpenAlexW2127828970MaRDI QIDQ549703

Ivan Rapaport, Pierre Guillon, Eric Goles Chacc

Publication date: 18 July 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1102.3522

zbMATH Keywords

cellular automatacommunication complexity

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Dynamical aspects of cellular automata (37B15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (2)

Unnamed Item ⋮ Communication complexity in number-conserving and monotone cellular automata

Cites Work

• Unnamed Item
• Unnamed Item
• Bulking II: Classifications of cellular automata
• Communication complexity and intrinsic universality in cellular automata
• Cellular automata and communication complexity
• On rank vs. communication complexity
• Understanding a Non-trivial Cellular Automaton by Finding Its Simplest Underlying Communication Protocol
• Languages, equicontinuity and attractors in cellular automata
• Communication Complexity

This page was built for publication: Traced communication complexity of cellular automata