Algorithmic Complexity and Cellular Automata

[1]  R. Robinson.  Undecidability and nonperiodicity for tilings of the plane , 1971 .

[2]  P. Kurka.  Languages, equicontinuity and attractors in cellular automata , 1997, Ergodic Theory and Dynamical Systems.

[3]  Cristian S. Calude.  Information and Randomness , 1994, Monographs in Theoretical Computer Science An EATCS Series.

[4]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[5]  H. White.  Algorithmic complexity of points in dynamical systems , 1993, Ergodic Theory and Dynamical Systems.

[6]  J. Mazoyer,et al.  Cellular Automata as Languages Recognizers , 1999 .

[7]  Petr Kurka,et al.  Cellular Automata in the Cantor, Besicovitch, and Weyl Topological Spaces , 1997, Complex Syst..

[8]  Jarkko Kari.  Rice's Theorem for the Limit Sets of Cellular Automata , 1994, Theor. Comput. Sci..

[9]  Robert W. Batterman,et al.  Chaos and algorithmic complexity , 1996 .

[10]  Véronique Terrier.  Language not Recognizable in Real Time by One-Way Cellular Automata , 1996, Theor. Comput. Sci..

[11]  Cristian S. Calude,et al.  Randomness on full shift spaces , 2001 .

[12]  Enrico Formenti,et al.  Some results about the chaotic behavior of cellular automata , 2005, Theor. Comput. Sci..

[13]  Péter Gács,et al.  Information Distance , 1998, IEEE Trans. Inf. Theory.

[14]  Enrico Formenti,et al.  Algorithmic Information Theory and Cellular Automata Dynamics , 2001, MFCS.

[15]  Ming Li,et al.  An Introduction to Kolmogorov Complexity and Its Applications , 2019, Texts in Computer Science.

[16]  M. Delorme,et al.  Cellular automata : a parallel model , 1999 .

[17]  Marcus Pivato,et al.  Cellular automata versus quasisturmian shifts , 2005, Ergodic Theory and Dynamical Systems.

[18]  Leonid A. Levin,et al.  Complex tilings , 2001, STOC '01.

[19]  A. Brudno.  Entropy and the complexity of the trajectories of a dynamical system , 1978 .