The structure of communication problems in cellular automata

Studying cellular automata with methods from communication complexity appears to be a promising approach. In the past, interesting connections between communication complexity and intrinsic universality in cellular automata were shown. One of the last extensions of this theory was its generalization to various "communication problems'', or "questions'' one might ask about the dynamics of cellular automata. In this article, we aim at structuring these problems, and find what makes them interesting for the study of intrinsic universality and quasi-orders induced by simulation relations.

[1]  Petr Kurka.  Topological Dynamics of Cellular Automata , 2009, Encyclopedia of Complexity and Systems Science.

[2]  Ivan Rapaport,et al.  Letting Alice and Bob choose which problem to solve: Implications to the study of cellular automata , 2013, Theor. Comput. Sci..

[3]  Andrew Chi-Chih Yao,et al.  Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.

[4]  Douglas Lind,et al.  An Introduction to Symbolic Dynamics and Coding , 1995 .

[5]  Petr Kůrka,et al.  Topological Dynamics of Cellular Automata , 2001 .

[6]  Guillaume Theyssier.  Automates cellulaires : un modèle de complexités. (Cellular automata: a model of complexities) , 2005 .

[7]  Guillaume Theyssier,et al.  On Factor Universality in Symbolic Spaces , 2010, MFCS.

[8]  Nicolas Ollinger,et al.  Bulking II: Classifications of cellular automata , 2010, Theor. Comput. Sci..

[9]  Guillaume Theyssier,et al.  Clandestine Simulations in Cellular Automata , 2010, JAC.

[10]  Nicolas Ollinger,et al.  Bulking I: An abstract theory of bulking , 2011, Theor. Comput. Sci..

[11]  Eric Goles Ch.,et al.  Communication complexity and intrinsic universality in cellular automata , 2011, Theor. Comput. Sci..

[12]  G. A. Hedlund.  Endomorphisms and automorphisms of the shift dynamical system , 1969, Mathematical systems theory.

[13]  Uijin Jung,et al.  On the existence of open and bi-continuing codes , 2008, 0810.4632.

[14]  A. Razborov.  Communication Complexity , 2011 .

[15]  Nicolas Ollinger.  The Intrinsic Universality Problem of One-Dimensional Cellular Automata , 2003, STACS.