Computability of tilings

IFIP International Federation for Information Processing

Volumn 273, Issue , 2008, Pages 187-201

  Lafitte, Grégory ^a   Weiss, Michael ^b  

^a AIX MARSEILLE UNIVERSITY   (France)

^b UNIVERSITY OF GENEVA   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

TURING MACHINES;

FINITE SET; RECURSIONS; ROBINSON; WANG TILES;

COMPUTER SCIENCE;

EID: 48249153813     PISSN: 15715736     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-0-387-09680-3_13     Document Type: Conference Paper

References (18)

1. ALLAUZEN (C.) and DURAND (B.), The Classical Decision Problem appendix A: "Tiling problems", p. 407-420. Springer, 1996.
2. BALLIER (A.), DURAND (B.) and JEANDEL (E.), «Structural Aspects of Tilings,» to appear in Proceedings of the Symposium on Theoretical Aspects of Computer Science, 2008.
3. BERGER (R.), «The undecidability of the domino problem,» Memoirs of the American Mathematical Society, vol. 66, 1966, p. 1-72.
4. CERVELLE (J.) and DURAND (B.), «Tilings: Recursivity and regularity,» Theoretical Computer Science, vol. 310, no° 1-3, 2004, p. 469-477.
5. CULIK II (K.) and KARI (J.), «On aperiodic sets of Wang tiles,» in Foundations of Computer Science: Potential - Theory - Cognition, p. 153-162, 1997. Computability of Tilings 201
6. DURAND (B.), «Tilings and quasiperiodicity,» Theoretical Computer Science, vol. 221, no° 1-2, 1999, p. 61-75.
7. DURAND (B.), «De la logique aux pavages,» Theoretical Computer Science, vol. 281, no° 1-2, 2002, p. 311-324.
8. DURAND (B.), LEVIN (L. A.) and SHEN (A.), «Complex tilings,» in Proceedings of the Symposium on Theory of Computing, p. 732-739, 2001.
9. DURAND (B.), ROMASHCHENKO (A.) and SHEN (A.), «Fixed point and aperiodic tilings,» preprint.
10. GUREVICH (Y.) and KORIAKOV (I.), «A remark on Berger's paper on the domino problem,» in Siberian Journal of Mathematics, 13 459-463, 1972. (In Russian).
11. HANF (W. P.), «Non-recursive tilings of the plane. I,» Journal of Symbolic Logic, vol. 39, no° 2, 1974, p. 283-285.
12. LAFITTE (G.) and WEISS (M.), «Universal Tilings,» in Proceedings of the Symposium on Theoretical Aspects of Computer Science Lecture Notes in Computer Science n° 4393, p. 367-380, 2007.
13. LAFITTE (G.) and WEISS (M.), «A topological study of tilings,» to appear in Proceedings of the conference on Theory and Aspects of Models of Computation, TAMC'08, 2008.
14. LAFITTE (G.) and WEISS (M.), «Simulation between tilings,» submitted to Computability in Europe, CIE'08, 2008.
15. MYERS (D.), «Non-recursive tilings of the plane. II,» Journal of Symbolic Logic, vol. 39, no 2, 1974, p. 286-294.
16. ROBINSON (R.), «Undecidability and nonperiodicity for tilings of the plane,» Inventiones Mathematicae, vol. 12, 1971, p. 177-209.
17. WANG (H.), «Proving theorems by pattern recognition II,» Bell System Technical Journal, vol. 40, 1961, p. 1-41.
18. WANG (H.), «Dominoes and the ∀∃∀-case of the decision problem,» in Proceedings of the Symposium on Mathematical Theory of Automata, p. 23-55, 1962.