Abstract
We show here how to construct a cellular automaton whose asymptotic set (the set of configurations it converges to) is maximally complex: it contains only configurations of maximal Kolmogorov complexity. This cellular automaton hence exhibits the most complex possible asymptotic behavior.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Allauzen, C., Durand, B.: Tiling Problems. In: The classical decision problem. Perspectives in Mathematical Logic. Springer, Heidelberg (2001)
Cattaneo, G., Dennunzio, A., Margara, L.: Chaotic Subshifts and Related Languages Applications to one-dimensional Cellular Automata. Fundamenta Informaticae 52(1-3), 39–80 (2002)
Cervelle, J.: Complexité dynamique et algorithmique des automates cellulaires. Habilitation à diriger des recherches, Université Paris Est, Marne-la-Vallée (December 2007)
Culik II, K., Pachl, J.K., Yu, S.: On the Limit Sets of Cellular Automata. SIAM J. Comput. 18(4), 831–842 (1989)
Durand, B., Levin, L.A., Shen, A.: Complex tilings. Journal of Symbolic Logic 73(2), 593–613 (2008)
Johnson, A., Madden, K.: Putting the Pieces Together: Understanding Robinson’s Nonperiodic Tilings. The College Mathematics Journal 28(3), 172–181 (1997)
Kari, J., Papasoglu, P.: Deterministic Aperiodic Tile Sets. Geometric And Functional Analysis 9, 353–369 (1999)
Kurka, P.: Languages, equicontinuity and attractors in cellular automata. Ergodic Theory & Dynamical Systems 17, 417–433 (1997)
Levin, L.A.: Aperiodic Tilings: Breaking Translational Symmetry. Comput. J. 48(6), 642–645 (2005)
Robinson, R.M.: Undecidability and Nonperiodicity for Tilings of the Plane. Inventiones Math 12 (1971)
Rumyantsev, A.Y., Ushakov, M.A.: Forbidden Substrings, Kolmogorov Complexity and Almost Periodic Sequences. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 396–407. Springer, Heidelberg (2006)
Wolfram, S.: Universality and complexity in cellular automata. Physica D 10, 1–35 (1984)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Durand, B., Poupet, V. (2009). Asymptotic Cellular Complexity. In: Diekert, V., Nowotka, D. (eds) Developments in Language Theory. DLT 2009. Lecture Notes in Computer Science, vol 5583. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02737-6_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-02737-6_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02736-9
Online ISBN: 978-3-642-02737-6
eBook Packages: Computer ScienceComputer Science (R0)