B. , D. A. Ballier, and E. , Structural aspects of tilings Preliminary version in HAL, 25th International Symposium on Theoretical Aspects of Computer Science (STACS), 2008.

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

J. Cervelle, Complexité structurelle et algorithmique des pavages et des automates cellulaires, 2002.

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

Y. Gurevich-ergon-börger and E. Grädel, The classical decision problem, 1996.

W. Hanf, Model-theoretic methods in the study of elementary logic. Symposium in the Theory of Models, pp.132-145, 1965.

. Abderezak-ould-houcine, On finitely generated models of theories with at most countably many non isomorphic finitely generated models

J. A. Makowsky, On some conjectures connected with complete sentences, Fund. Math, vol.81, pp.193-202, 1974.

F. Oger, Algebraic and model-theoretic properties of tilings. Theoretical computer science, pp.103-126, 2004.

B. Poizat, Une theorie finiement axiomatisable et superstable. Groupe d'etude des theories stables, pp.1-9, 1980.

H. Wang, Proving theorems by pattern recognition ii. Bell system technical journal, pp.1-41, 1961.
DOI : 10.1007/978-94-009-2356-0_9

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, Proving theorems by pattern recognition i. The Journal of Symbolic Logic, 1967.
DOI : 10.1145/367177.367224