C. Allauzen and B. Durand, Tiling Problems The Classical Decision Problem, Perspectives in Mathematical Logic, pp.407-420, 2001.

[. Ammann, B. Grünbaum, and G. C. Shephard, Aperiodic tiles, Discrete & Computational Geometry, vol.43, issue.1, pp.1-25, 1992.
DOI : 10.1007/BF02293033

A. Akhavi, I. Klimann, S. Lombardy, J. Mairesse, and M. Picantin, ON THE FINITENESS PROBLEM FOR AUTOMATON (SEMI)GROUPS, International Journal of Algebra and Computation, vol.22, issue.06, pp.22-2012
DOI : 10.1142/S021819671250052X
URL : https://hal.archives-ouvertes.fr/hal-00695445

O. Stål, H. R. Aanderaa, and . Lewis, Linear Sampling and the ??? Case of the Decision Problem, Journal of Symbolic Logic, vol.39, issue.3, pp.519-548, 1974.

N. Aubrun and M. Sablik, Simulation of Effective Subshifts by Two-dimensional Subshifts of Finite Type, Acta Applicandae Mathematicae, vol.12, issue.3, pp.35-63, 2013.
DOI : 10.1007/s10440-013-9808-5
URL : https://hal.archives-ouvertes.fr/hal-01275179

A. Ballier, Propriétés structurelles, combinatoires et logiques des pavages, 2009.

D. Vincent, J. Blondel, C. M. Cassaigne, and . Nichitiu, On the presence of periodic configurations in turing machines and in counter machines, Theor. Comput. Sci, vol.289, issue.1, pp.573-590, 2002.

[. Bennett, Logical Reversibility of Computation, IBM Journal of Research and Development, vol.17, issue.6
DOI : 10.1147/rd.176.0525

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. Berger, The Undecidability of the Domino Problem. Number 66, 1966.

E. Börger, E. Grädel, and Y. Gurevich, The Classical Decision Problem, Perspectives in Mathematical Logic BIBLIOGRAPHIE, 2001.
DOI : 10.1007/978-3-642-59207-2

A. Ballier and E. Jeandel, Tilings and model theory, pp.29-39, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00273698

M. Boyle and D. Lind, Expansive subdynamics, CI96] Karel Culik II. An aperiodic set of 13 Wang tiles. Discrete Mathematics, pp.55-102245, 1996.
DOI : 10.1090/S0002-9947-97-01634-6

J. Cassaigne, N. Ollinger, and R. Torres, A small minimal aperiodic reversible Turing machine, Journal of Computer and System Sciences, vol.84, 2014.
DOI : 10.1016/j.jcss.2016.10.004
URL : https://hal.archives-ouvertes.fr/hal-00975244

[. Durand, L. A. Levin, and A. Shen, Complex tilings, Proceedings on 33rd Annual ACM Symposium on Theory of Computing, pp.732-739, 2001.

[. Durand, L. A. Levin, and A. Shen, Local rules and global order, or aperiodic tilings, The Mathematical Intelligencer, vol.12, issue.1, pp.64-68, 2005.
DOI : 10.1007/BF02984815

B. Durand, A. E. Romashchenko, and A. Shen, Fixed Point and Aperiodic Tilings, Developments in Language Theory, pp.276-288, 2008.
DOI : 10.1007/978-3-540-85780-8_22

[. Durand, A. E. Romashchenko, and A. Shen, Fixed-point tile sets and their applications, Journal of Computer and System Sciences, vol.78, issue.3, pp.731-764, 2012.
DOI : 10.1016/j.jcss.2011.11.001
URL : https://hal.archives-ouvertes.fr/lirmm-00736079

[. Durand, A. Shen, and N. Vereshchagin, Ammann tilings : a classification and an application. ArXiv e-prints, 2011.

B. Durand, Tilings and quasiperiodicity, Theoretical Computer Science, vol.221, issue.1-2, pp.61-75, 1999.
DOI : 10.1016/S0304-3975(99)00027-4
URL : https://hal.archives-ouvertes.fr/lirmm-01165314

B. Durand and . De, [FO10] Thomas Fernique and Nicolas Ollinger. Combinatorial Substitutions and Sofic Tilings, TUCS Proceedings of JAC 2010 Journées Automates Cellulaires 2010, pp.311-324, 2002.

P. Gillibert, THE FINITENESS PROBLEM FOR AUTOMATON SEMIGROUPS IS UNDECIDABLE, International Journal of Algebra and Computation, vol.24, issue.01, pp.1-10, 2014.
DOI : 10.1142/S0218196714500015
URL : https://hal.archives-ouvertes.fr/hal-00809295

Y. Sh, I. O. Gurevich, and . Koryakov, Remarks on Berger's paper on the domino problem, Siberian Mathematical Journal, vol.13, issue.2, pp.319-321, 1972.

A. Grandjean, G. Richard, and V. Terrier, Linear functional classes over cellular automata, Electronic Proceedings in Theoretical Computer Science, vol.90, pp.177-193, 2012.
DOI : 10.4204/EPTCS.90.15
URL : https://hal.archives-ouvertes.fr/hal-01085911

[. Grünbaum, G. C. Shephard, P. W. Tilings, C. Freeman, and . Goodman-strauss, Matching rules and substitution tilings, Annals of Mathematics, vol.147, issue.1, pp.181-223, 1987.

P. Guillon and C. Zinoviadis, Densities and Entropies in Cellular Automata, How the World Computes, pp.253-263, 2012.
DOI : 10.1007/978-3-642-30870-3_26

P. Guillon and C. Zinoviadis, Hierarchy and expansiveness, 2013.

P. Gács, Reliable cellular automata with self-organization, Proceedings 38th Annual Symposium on Foundations of Computer Science
DOI : 10.1109/SFCS.1997.646097

P. William and . Hanf, Nonrecursive tilings of the plane, I. J. Symb. Log, vol.39, issue.2, pp.283-285, 1974.

M. Hochman, Non-expansive directions for Z 2 actions. Ergodic Theory and Dynamical Systems, pp.91-112

K. Philip and . Hooper, The Undecidability of the Turing Machine Immortality Problem, Journal of Symbolic Logic, vol.31, issue.2, pp.219-234, 1966.

G. Theyssier, Subshifts, languages and logic Subshifts as models for mso logic, Developments in Language Theory, pp.288-2991, 2009.

B. and P. Vanier, Periodicity in tilings, Developments in Language Theory, 14th International Conference, DLT 2010 Proceedings, pp.243-254, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00419196

T. P. Sets and . Vanier, Theory and Applications of Models of Computation Hardness of conjugacy, embedding and factorization of multidimensional subshifts of finite type, 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013 Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, pp.230-239, 2011.

J. Kari, The Nilpotency Problem of One-Dimensional Cellular Automata, SIAM Journal on Computing, vol.21, issue.3, pp.571-586, 1992.
DOI : 10.1137/0221036

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

J. Kari, A small aperiodic set of Wang tiles, Discrete Mathematics, vol.160, issue.1-3, pp.259-264, 1996.
DOI : 10.1016/0012-365X(95)00120-L

J. Kari, The Tiling Problem Revisited (Extended Abstract), Lecture Notes in Computer Science, vol.4664, pp.72-79, 2007.
DOI : 10.1007/978-3-540-74593-8_6

[. Kari, Lecture notes on Cellular Automata, 2009.

[. Kari, Lecture notes on Tilings and Patterns, 2009.

I. Klimann, Une introduction aux (semi-)groupes d'automate. Lecture notes. MPRI, 2013. [Kli14] Ines Klimann Autour de divers problèmes de décision sur les automates, 2014.
URL : https://hal.archives-ouvertes.fr/cel-01058503

E. [. Kahr, H. Moore, and . Wang, Entscheidungsproblem reduced to the ??? case, Proceedings of the National Academy of Sciences of the United States of America, pp.365-377, 1962.

N. Kushilevitz and . Nisan, Communication Complexity, 1997.

D. Knuth, Fundamental Algorithms, volume 1 of The Art of Computer Programming, section 2.3.4.3 The infinity lemma, pp.382-385, 1968.

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

P. K?rka, Topological and symbolic dynamics, SMF, vol.11, 2003.

Y. Lecerflev05, . A. Leonid, and . Levin, Machines de Turing réversibles Comptes rendus de l'Académie française des Sciences Aperiodic tilings : Breaking translational symmetry, Comput. J, vol.257, issue.486, pp.2597-2600642, 1963.

R. Harry and . Lewis, Unsolvable Classes of Quantificational Formulas, 1979.

[. Gloannec, The 4-way deterministic Periodic Domino Problem is undecidable, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00985482

G. Bastien-le and N. Ollinger, Substitutions and strongly deterministic tilesets, How the World Computes, pp.462-471

[. , L. Gloannec, and N. Ollinger, Knight tiles : particles and collisions in the realm of 4-way deterministic tilings, Proceedings of the 18th International Conference on Developments in Language Theory, pp.227-238, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00960244

[. Lind and B. Marcus, An introduction to symbolic dynamics and coding, 1995.
DOI : 10.1017/CBO9780511626302

V. Lukkarila, On the Tiling Problem and Reversible Cellular Automata, 2006.

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

V. Lukkarila, On Undecidable Dynamical Properties of Reversible One-Dimensional Cellular Automata, 2010.

[. Lafitte and M. Weiss, Computability of Tilings, IFIP TCS, pp.187-201, 2008.
DOI : 10.1007/978-0-387-09680-3_13

[. Lafitte and M. Weiss, Constructing New Aperiodic Self-simulating Tile Sets, Lecture Notes in Computer Science, vol.40, issue.2, pp.300-309, 2009.
DOI : 10.1002/j.1538-7305.1961.tb03975.x

J. Mazoyer, A six-state minimal time solution to the firing squad synchronization problem, Theoretical Computer Science, vol.50, issue.2, pp.183-238, 1987.
DOI : 10.1016/0304-3975(87)90124-1

L. Marvin and . Minsky, Computation : Finite and Infinite Machines, 1967.

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

B. Mossé, Puissance de mots et reconnaissabilit?? des points fixes d'une substitution, Theoretical Computer Science, vol.99, issue.2, pp.327-334, 1992.
DOI : 10.1016/0304-3975(92)90357-L

B. Mossé, Reconnaissabilit?? des substitutions et complexit?? des suites automatiques, Bulletin de la Société mathématique de France, vol.124, issue.2, pp.329-346, 1996.
DOI : 10.24033/bsmf.2283

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, Global fixed point attractors of circular cellular automata and periodic tilings of the plane: Undecidability results, Discrete Mathematics, vol.199, issue.1-3, pp.103-122, 1999.
DOI : 10.1016/S0012-365X(98)00203-9

J. Mazoyer and V. Terrier, Signals in one-dimensional cellular automata, Theoretical Computer Science, vol.217, issue.1, pp.53-80, 1999.
DOI : 10.1016/S0304-3975(98)00150-9

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

[. Ollinger, Programmation et indécidabilités dans les systèmes complexes, 2008.

[. Ollinger, Two-by-Two Substitution Systems and the Undecidability of the Domino Problem, p.159
DOI : 10.1007/978-3-540-69407-6_51
URL : https://hal.archives-ouvertes.fr/hal-00204625

[. Fogg, Substitutions in Dynamics [PF08] Nathalie Priebe Frank. A primer of substitution tilings of the Euclidean plane, Pou10] Victor Poupet. Yet another aperiodic tile set, pp.295-326, 2002.

G. Richard, Systèmes de particules et collisions discrètes dans les automates cellulaires, 2008.

R. M. Robinson, Undecidability and nonperiodicity for tilings of the plane, Automata, Languages and Programming, pp.177-209, 1971.
DOI : 10.1007/BF01418780

A. Mathison and T. , On computable numbers, with an application to the entscheidungsproblem, J. of Math, vol.58, pp.345-363, 1936.

H. Wang, Proving Theorems by Pattern Recognition - II, Bell System Technical Journal, vol.40, issue.1, pp.1-41, 1961.
DOI : 10.1002/j.1538-7305.1961.tb03975.x

H. Wang, Dominoes and the Aea Case of the Decision Problem, Mathematical Theory of Automata, pp.23-55, 1963.
DOI : 10.1007/978-94-009-2356-0_11

H. Wang, Notes on a class of tiling problems, Fundamenta Mathematicae, vol.82, pp.295-305, 1975.

P. Winkler, Five algorithmic puzzles. Tribute to a Mathemagician, p.109, 2004.

J. Yunès, Synchronisation et Automates Cellulaires : La Ligne de Fusiliers, 1993.