N. Aubrun and M. Sablik, An order on sets of tilings corresponding to an order on languages, STACS, pp.99-110, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00359625

R. Berger, The Undecidability of the Domino Problem. Number 66 in Memoirs of the, 1966.

J. and R. Buchi, Turing-Machines and the Entscheidungsproblem, Math. Annalen, vol.148, pp.201-213, 1962.
DOI : 10.1007/978-1-4613-8928-6_34

G. Chaitin, The Halting Probability via Wang Tiles, Fundamenta Informaticae, vol.86, issue.4, pp.429-433, 2008.

M. Hochman and T. Meyerovitch, A characterization of the entropies of multidimensional shifts of finite type, Annals of Mathematics, vol.171, issue.3, 2008.
DOI : 10.4007/annals.2010.171.2011

E. Jeandel and P. Vanier, Periodicity in Tilings, Developments in Language Theory (DLT), 2010.
DOI : 10.1007/978-3-642-14455-4_23
URL : https://hal.archives-ouvertes.fr/hal-00419196

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, RECENT RESULTS ON APERIODIC WANG TILINGS, Pattern formation in biology, vision and dynamics, pp.83-96, 2000.
DOI : 10.1142/9789812817723_0005

A. Douglas, B. Lind, and . Marcus, An Introduction to Symbolic Dynamics and Coding, 1995.

T. Meyerovitch, Growth-type invariants for Z d subshifts of finite type and classes arithmetical of real numbers

P. G. Odifreddi, Classical Recursion Theory, of Studies in Logic and the Foundations of Mathematics, 1992.

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

P. Van and E. Boas, The convenience of Tilings, Complexity, Logic, and Recursion Theory, 1997.

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