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

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

J. Kari and P. Papasoglu, Deterministic Aperiodic Tile Sets, Geometric And Functional Analysis, vol.9, issue.2, pp.353-369, 1999.
DOI : 10.1007/s000390050090

L. Gloannec, B. Ollinger, and N. , Substitutions and Strongly Deterministic Tilesets, CiE. Lecture Notes in Computer Science, vol.7318, pp.462-471, 2012.
DOI : 10.1007/978-3-642-30870-3_47
URL : https://hal.archives-ouvertes.fr/hal-00661887

V. Lukkarila, The 4-way deterministic tiling problem is undecidable, Theoretical Computer Science, vol.410, issue.16, pp.1516-1533, 2009.
DOI : 10.1016/j.tcs.2008.12.006

M. Boyle and D. Lind, Expansive subdynamics, Transactions of the American Mathematical Society, vol.349, issue.01, pp.55-102, 1997.
DOI : 10.1090/S0002-9947-97-01634-6

K. Morita, Reversible simulation of one-dimensional irreversible cellular automata, Theoretical Computer Science, vol.148, issue.1, pp.157-163, 1995.
DOI : 10.1016/0304-3975(95)00038-X

J. Kari, Rice's theorem for the limit sets of cellular automata, Theoretical Computer Science, vol.127, issue.2, pp.229-254, 1994.
DOI : 10.1016/0304-3975(94)90041-8

Y. Lecerf, Machines de Turing réversibles Comptes rendus de l, Académie française des Sciences, vol.257, pp.2597-2600, 1963.

C. H. Bennett, Logical Reversibility of Computation, IBM Journal of Research and Development, vol.17, issue.6, pp.525-532, 1973.
DOI : 10.1147/rd.176.0525

P. Fogg and N. , Substitutions in Dynamics, Arithmetics and Combinatorics, Lecture Notes in Mathematics, vol.1794, 2002.
DOI : 10.1007/b13861