J. Altenbernd, W. Thomas, and S. Wohrle, Tiling Systems over Infinite Pictures and Their Acceptance Conditions, Developments in Language Theory, 2003.
DOI : 10.1007/3-540-45005-X_26

A. Ballier and E. Jeandel, Tilings and model theory, First Symposium on Cellular Automata Journées Automates Cellulaires, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00273698

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

H. Ebbinghaus and J. Flum, Finite Model Theory, 1995.

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

D. Giammarresi and A. Restivo, Handbook of Formal Languages, 1997.

D. Giammarresi, A. Restivo, S. Seibert, and W. Thomas, Monadic Second-Order Logic over Rectangular Pictures and Recognizability by Tiling Systems, Information and Computation, vol.125, issue.1, pp.32-45, 1996.
DOI : 10.1006/inco.1996.0018

W. Hanf, MODEL-THEORETIC METHODS IN THE STUDY OF ELEMENTARY LOGIC, Symposium in the Theory of Models, pp.132-145, 1965.
DOI : 10.1016/B978-0-7204-2233-7.50020-4

D. Harel, Recurring Dominoes: Making the Highly Undecidable Highly Understandable, Annals of Discrete Mathematics, vol.24, pp.51-72, 1985.
DOI : 10.1016/S0304-0208(08)73075-5

D. Kuske and M. Lohrey, Logical aspects of Cayley-graphs: the group case, Annals of Pure and Applied Logic, vol.131, issue.1-3, pp.263-286, 2005.
DOI : 10.1016/j.apal.2004.06.002

L. Libkin, Elements of Finite Model Theory. Texts in Theoretical Computer Science, an EATCS Series, 2004.

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

O. Matz and N. Schweikardt, Expressive power of monadic logics on words, trees, pictures, and graphs, Logic and Automata: History and Perspectives, Texts in Logic and Games, pp.531-552, 2007.

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

B. Poizat, Une théorie finiement axiomatisable et superstable, pp.1-9, 1980.

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

T. Schwentick and K. Barthelmann, Local normal forms for first-order logic with applications to games and automata, Discrete Mathematics and Theoretical Computer Science, vol.3, pp.109-124, 1999.
DOI : 10.1007/BFb0028580
URL : https://hal.archives-ouvertes.fr/hal-00958930

D. Seese, The structure of the models of decidable monadic theories of graphs. Annals of pure and applied logic, pp.169-195, 1991.

W. Thomas, On logics, tilings, and automata, Proceedings of the 18th International Colloquium on Automata, Languages and Programming, pp.441-454, 1991.
DOI : 10.1007/3-540-54233-7_154

W. Thomas, Handbook of Formal Languages, Automata, and Logic, 1997.

H. Wang, Proving theorems by pattern recognition ii. Bell system technical journal, pp.1-41, 1961.

B. Weiss, Subshifts of finite type and sofic systems, Monatshefte f???r Mathematik, vol.76, issue.5, pp.462-474, 1973.
DOI : 10.1007/BF01295322