Communications in cellular automata
The goal of this paper is to show why the framework of communication complexity seems suitable for the study of cellular automata. Researchers have tackled different algorithmic problems ranging from the complexity of predicting to the decidability of different dynamical properties of cellular autom...
Main Authors: | Guillaume Theyssier, Ivan Rapaport, Eric Goles, Pierre-Etienne Meunier |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2009-06-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/0906.3284v1 |
Similar Items
-
Intrinsic Simulations between Stochastic Cellular Automata
by: Pablo Arrighi, et al.
Published: (2012-08-01) -
Bounded Languages Meet Cellular Automata with Sparse Communication
by: Martin Kutrib, et al.
Published: (2009-07-01) -
Increasing coupling for probabilistic cellular automata
by: Louis, Pierre-Yves
Published: (2005) -
Increasing Coupling of Probabilistic Cellular Automata
by: Louis, Pierre-Yves
Published: (2004) -
Cellular Automata and Cryptography
by: Tiago Coelho dos Santos
Published: (2019)