Abstract
Topological dynamics of cellular automata (CA), inherited from classical dynamical systems theory, has been essentially studied in dimension 1. This paper focuses on 2D CA and aims at showing that the situation is different and more complex. The main results are the existence of non sensitive CA without equicontinuous points, the non-recursivity of sensitivity constants and the existence of CA having only non-recursive equicontinuous points. They all show a difference between the 1D and the 2D case. Thanks to these new constructions, we also extend undecidability results concerning topological classification previously obtained in the 1D case.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Kůrka, P.: Languages, equicontinuity and attractors in cellular automata. Ergodic Theory and Dynamical Systems 17, 417–433 (1997)
Blanchard, F., Maass, A.: Dynamical properties of expansive one-sided cellular automata. Israel J. Math. 99 (1997)
Blanchard, F., Tisseur, P.: Some properties of cellular automata with equicontinuity points. Ann. Inst. Henri Poincaré, Probabilités et statistiques 36, 569–582 (2000)
Fagnani, F., Margara, L.: Expansivity, permutivity, and chaos for cellular automata. Theory of Computing Systems 31(6), 663–677 (1998)
Durand, B., Formenti, E., Varouchas, G.: On undecidability of equicontinuity classification for cellular automata. In: Morvan, M., Rémila, É. (eds.) DMCS 2003. Volume AB of DMTCS Proceedings, pp. 117–128 (2003)
Kari, J.: Reversibility and Surjectivity Problems of Cellular Automata. Journal of Computer and System Sciences 48(1), 149–182 (1994)
Bernardi, V., Durand, B., Formenti, E., Kari, J.: A new dimension sensitive property for cellular automata. In: Fiala, J., Koubek, V., Kratochvíl, J. (eds.) MFCS 2004. LNCS, vol. 3153, pp. 416–426. Springer, Heidelberg (2004)
Berger, R.: The undecidability of the domino problem. Mem. Amer. Math Soc. 66 (1966)
Hedlund, G.A.: Endomorphisms and Automorphisms of the Shift Dynamical Systems. Mathematical Systems Theory 3(4), 320–375 (1969)
Wang, H.: Proving theorems by pattern recognition ii. Bell System Tech. Journal 40(2) (1961)
Myers, D.: Nonrecursive tilings of the plane. ii. The Journal of Symbolic Logic 39(2), 286–294 (1966)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sablik, M., Theyssier, G. (2008). Topological Dynamics of 2D Cellular Automata. In: Beckmann, A., Dimitracopoulos, C., Löwe, B. (eds) Logic and Theory of Algorithms. CiE 2008. Lecture Notes in Computer Science, vol 5028. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69407-6_56
Download citation
DOI: https://doi.org/10.1007/978-3-540-69407-6_56
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69405-2
Online ISBN: 978-3-540-69407-6
eBook Packages: Computer ScienceComputer Science (R0)