, Tiling Problems In The Classical Decision Problem, Perspectives in Mathematical Logic, pp.407-420, 2001.
, Linear sampling and the ????????? case of the decision problem, The Journal of Symbolic Logic, vol.68, issue.03, pp.519-548, 1974.
DOI : 10.2307/2272894
, The undecidability of the domino problem, Memoirs of the American Mathematical Society, vol.0, issue.66, 1964.
DOI : 10.1090/memo/0066
, The Undecidability of the Domino Problem. Number 66 in Memoirs of the, 1966.
, Sturmian Words, Algebraic Combinatorics on Words, pp.40-97, 2002.
URL : https://hal.archives-ouvertes.fr/hal-00620780
, Nonemptiness problems of Wang tiles with three colors, Theoretical Computer Science, vol.547, pp.34-45, 2014.
DOI : 10.1016/j.tcs.2014.06.015
, An aperiodic set of 13 Wang tiles, Discrete Mathematics, vol.160, issue.1-3, pp.245-251, 1996.
DOI : 10.1016/S0012-365X(96)00118-5
, Local rules and global order, or aperiodic tilings, The Mathematical Intelligencer, vol.12, issue.1, pp.64-68, 2004.
DOI : 10.1007/BF02984815
, 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
, Fixed Point and Aperiodic Tilings, 2008.
DOI : 10.1007/978-3-540-85780-8_22
URL : http://arxiv.org/abs/0802.2432
, Combinatorics and Topology of the Robinson tiling Comptes Rendus de l'Académie des Sciences de Paris, Série I -Mathématiques, FO10] Thomas Fernique and Nicolas Ollinger. Combinatorial Substitutions and Sofic Tilings . In Journées Automates Cellulaires (JAC), TUCS, pp.627-631, 2010.
, Matching Rules and Substitution Tilings, The Annals of Mathematics, vol.147, issue.1, pp.181-223, 1998.
DOI : 10.2307/120988
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.173.8436
, A Simplified Proof for the Unsolvability of the Decision Problem in the Case ?????????, Logic Colloquium of Studies in Logic and the Foundations of Mathematics, pp.307-310, 1969.
DOI : 10.1016/S0049-237X(08)71235-7
, AN n log n ALGORITHM FOR MINIMIZING STATES IN A FINITE AUTOMATON, 1971.
DOI : 10.1016/B978-0-12-417750-5.50022-1
, Putting the Pieces Together: Understanding Robinson's Nonperiodic Tilings, The College Mathematics Journal, vol.28, issue.3, pp.172-181, 1997.
DOI : 10.2307/2687520
, Fixed parameter undecidability for wang tilesets, Symposium on Cellular Automata (JAC), pp.69-85, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00739038
, The Nilpotency Problem of One-Dimensional Cellular Automata, SIAM Journal on Computing, vol.21, issue.3, pp.571-586, 1992.
DOI : 10.1137/0221036
, 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
, Entscheidungsproblem reduced to the ??? case, Proceedings of the National Academy of Sciences of the United States of America, pp.365-377, 1962.
, Fundamental Algorithms, volume 1 of The Art of Computer Programming, section 2.3.4.3 The infinity lemma, pp.382-385, 1968.
, Deterministic Aperiodic Tile Sets, Geometric And Functional Analysis, vol.9, issue.2, pp.353-369, 1999.
DOI : 10.1007/s000390050090
, CCS Expressions, Finite State Processes and Three Problems of Equivalence, Information and Computation, vol.86, pp.43-68, 1990.
, Aperiodic Tilings: Breaking Translational Symmetry, The Computer Journal, vol.48, issue.6, pp.642-645, 2005.
, Unsolvable Classes of Quantificational Formulas, 1979.
, Substitutions and Strongly Deterministic Tilesets, Computability in Europe (CiE), number 7318 in Lecture Notes in Computer Science, pp.462-471, 2012.
DOI : 10.1007/978-3-642-30870-3_47
, 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
, 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
, Two-by-Two Substitution Systems and the Undecidability of the Domino Problem, CiE 2008, number 5028 in Lecture Notes in Computer Science, pp.476-485, 2008.
DOI : 10.1007/978-3-540-69407-6_51
URL : https://hal.archives-ouvertes.fr/hal-00204625
, Une théorie finiement axiomatisable et superstable. Groupe d'études de théories stables, pp.1-9, 1980.
, Yet Another Aperiodic Tile Set, Journées Automates Cellulaires (JAC), TUCS, pp.191-202, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00542328
, Three Partition Refinement Algorithms, SIAM Journal on Computing, vol.16, issue.6, pp.973-989, 1987.
DOI : 10.1137/0216062
, Undecidability and nonperiodicity for tilings of the plane, Inventiones Mathematicae, vol.40, issue.3, pp.177-209, 1971.
DOI : 10.1007/BF01418780
, Quelles tuiles ! (Pavages ap??riodiques du plan et automates bidimensionnels), Journal de Th??orie des Nombres de Bordeaux, vol.1, issue.1, pp.1-26, 1989.
DOI : 10.5802/jtnb.1
, Quasicrystals and geometry, 1995.
, Simple Bisimilarity Minimization in O(m log n) Time, Fundamenta Informaticae, vol.105, pp.319-339, 2010.
, 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
, Notes on a class of tiling problems, Fundamenta Mathematicae, vol.82, pp.295-305, 1975.
, Some Properties of the Singular Words of the Fibonacci Word, European Journal of Combinatorics, vol.15, issue.6, pp.587-598, 1994.