M. Sablik and G. Theyssier, Topological Dynamics of 2D Cellular Automata, In: CiE, pp.523-532, 2008.
DOI : 10.1007/978-3-540-69407-6_56
URL : https://hal.archives-ouvertes.fr/hal-00175396

P. K?rka, Languages, equicontinuity and attractors in cellular automata, Ergodic Theory and Dynamical Systems, vol.17, issue.2, pp.417-433, 1997.
DOI : 10.1017/S014338579706985X

F. Blanchard and A. Maass, Dynamical properties of expansive one-sided cellular automata, Israel Journal of Mathematics, vol.114, issue.1, p.99, 1997.
DOI : 10.1007/BF02760680

F. Blanchard and P. Tisseur, Some properties of cellular automata with equicontinuity points, Probabilités et statistiques, pp.36-569, 2000.
DOI : 10.1016/S0246-0203(00)00141-2
URL : https://hal.archives-ouvertes.fr/hal-00000924

F. Fagnani and L. Margara, Expansivity, Permutivity, and Chaos for Cellular Automata, Theory of Computing Systems, vol.31, issue.6, pp.663-677, 1998.
DOI : 10.1007/s002240000108

B. Durand, E. Formenti, and G. Varouchas, On undecidability of equicontinuity classification for cellular automata, DMCS'03
URL : https://hal.archives-ouvertes.fr/hal-01183309

J. Kari, Reversibility and surjectivity problems of cellular automata, Journal of Computer and System Sciences, vol.48, issue.1, pp.149-182, 1994.
DOI : 10.1016/S0022-0000(05)80025-X

V. Bernardi, B. Durand, E. Formenti, and J. Kari, A New Dimension Sensitive Property for Cellular Automata, Mathematical Foundations of Computer Science Lecture Notes in Computer Science, vol.3153, pp.416-426, 2004.
DOI : 10.1007/978-3-540-28629-5_31

G. A. Hedlund, Endomorphisms and automorphisms of the shift dynamical system, Mathematical Systems Theory, vol.18, issue.4, pp.320-375, 1969.
DOI : 10.1007/BF01691062

R. Berger, The undecidability of the domino problem, Memoirs of the American Mathematical Society, vol.0, issue.66, 1966.
DOI : 10.1090/memo/0066

D. Myers, Nonrecursive tilings of the plane. II, The Journal of Symbolic Logic, vol.39, issue.02, pp.286-294, 1966.
DOI : 10.1007/BF01418780

W. Hanf, Nonrecursive tilings of the plane. I, The Journal of Symbolic Logic, vol.30, issue.02, pp.283-285, 1966.
DOI : 10.1002/j.1538-7305.1961.tb03975.x

H. Rogers, Theory of recursive functions and effective computability, 1967.

H. Wang, Proving theorems by pattern recognition ii. Bell System Tech, Journal, vol.40, issue.2, 1961.