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

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.

M. Delacourt, Rice's theorem for mu-limit sets of cellular automata, 2011.

L. Boyer and G. Theyssier, On Factor Universality in Symbolic Spaces, pp.209-220, 2010.
DOI : 10.1007/978-3-642-15155-2_20
URL : https://hal.archives-ouvertes.fr/hal-00474559

L. Boyer and G. Theyssier, On local symmetries and universality in cellular automata, pp.195-206, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00359174

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

D. Doty, M. J. Patitz, D. Reishus, R. T. Schweller, and S. M. Summers, Strong Fault-Tolerance for Self-Assembly with Fuzzy Temperature, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, pp.417-426, 2010.
DOI : 10.1109/FOCS.2010.47

D. Doty, J. H. Lutz, M. J. Patitz, S. M. Summers, and D. Woods, Intrinsic universality in self-assembly, pp.275-286, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00455225

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

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

E. Börger, E. Grädel, and Y. Gurevich, The classical decision problem, 1996.
DOI : 10.1007/978-3-642-59207-2

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

D. Seese, The structure of the models of decidable monadic theories of graphs, Annals of Pure and Applied Logic, vol.53, issue.2, pp.169-195, 1991.
DOI : 10.1016/0168-0072(91)90054-P

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

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
DOI : 10.1007/BF01418780

F. Oger, Algebraic and model-theoretic properties of tilings, Theoretical Computer Science, vol.319, issue.1-3, pp.103-126, 2004.
DOI : 10.1016/j.tcs.2004.02.019

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

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
URL : http://doi.org/10.1006/inco.1996.0018

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

M. Anselmo, N. Jonoska, and M. Madonia, Framed Versus Unframed Two-Dimensional Languages, 35th Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM, pp.79-92, 2009.
DOI : 10.1007/BF01418780

J. Altenbernd, W. Thomas, and S. Wohrle, Tiling Systems over Infinite Pictures and Their Acceptance Conditions, 2003.
DOI : 10.1007/3-540-45005-X_26
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.69.9068

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

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

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

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

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. Lind and B. Marcus, An introduction to symbolic dynamics and coding, 1995.
DOI : 10.1017/CBO9780511626302

M. Grohe and S. Wöhrle, An existential locality theorem, Annals of Pure and Applied Logic, vol.129, issue.1-3, pp.131-148, 2004.
DOI : 10.1016/j.apal.2004.01.005

D. Beauquier and J. Pin, Languages and scanners, Theoretical Computer Science, vol.84, issue.1, pp.3-21, 1991.
DOI : 10.1016/0304-3975(91)90258-4