A. Ballier and B. Durand, Structural Aspects of Tilings, Proceedings of the 25th Symposium on Theoretical Aspects of Computer Science : STACS 2008 Beal. Codage Symbolique. Masson, 1993.
URL : https://hal.archives-ouvertes.fr/hal-00145800

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

W. Hanf, Nonrecursive tilings of the plane. i. The Journal of Symbolic Logic, pp.283-285, 1974.

G. Hedlund, Endomorphisms and automorphisms of the shift dynamical system, Theory of Computing Systems, pp.320-375, 1969.
DOI : 10.1007/BF01691062

M. Hochman, On the dynamics and recursive properties of multidimensional symbolic systems, Kit98] B. Kitchens. Symbolic dynamics, 1998.
DOI : 10.1007/s00222-008-0161-7

D. Lind and B. Marcus, An Introduction to Symbolic Dynamics and Coding, 1995.
DOI : 10.1017/CBO9780511626302

S. Mozes, Tilings, substitution systems and dynamical systems generated by them, Journal d'Analyse Math??matique, vol.53, issue.1, pp.139-186, 1989.
DOI : 10.1007/BF02793412

J. Mazoyer and I. Rapaport, Inducing an order on cellular automata by a grouping operation, Discrete Applied Mathematics, vol.91, issue.1-3, pp.177-196, 1999.
DOI : 10.1016/S0166-218X(98)00125-5

N. Ollinger, The Intrinsic Universality Problem of One-Dimensional Cellular Automata, Symposium on Theoretical Aspects of Computer Science (STACS'2003), pp.632-641, 2003.
DOI : 10.1007/3-540-36494-3_55

H. and R. Jr, Theory of recursive functions and effective computability, 1987.

R. M. Robinson, Undecidability and nonperiodicity for tilings of the plane, Inventiones Mathematicae, vol.40, issue.3, pp.177-209, 1971.
DOI : 10.1007/BF01418780

G. Theyssier, Automates cellulaires: un modèle de complexités, 2005.