A topological study of tilings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4978 LNCS, Issue , 2008, Pages 375-387

  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

COLOR MATCHING; TOPOLOGY;

COMPUTATION MODEL; GLOBAL STRUCTURE; INFINITE GAME;

COMPUTATION THEORY;

EID: 70349319535     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-79228-4_33     Document Type: Conference Paper

References (17)

1. [AD96] Allauzen, C., Durand, B.: The Classical Decision Problem. In: Appendix A: "Tiling problems", pp. 407-420. Springer, Heidelberg (1996)
2. [Ber66] Berger, R.: The undecidability of the domino problem. Memoirs of the American Mathematical Society 66, 1-72 (1966)
3. [CD04] Cervelle, J., Durand, B.: Tilings: recursivity and regularity. Theoretical Computer Science 310(1-3), 469-477 (2004)
4. [CK97] Culik II, K., Kari, J.: On aperiodic sets of Wang tiles. In: Foundations of Computer Science: Potential - Theory - Cognition, pp. 153-162 (1997)
5. [DLS01] Durand, B., Levin, L.A., Shen, A.: Complex tilings. In: Proceedings of the Symposium on Theory of Computing, pp. 732-739 (2001)
6. [Dur99] Durand, B.: Tilings and quasiperiodicity. Theoretical Computer Science 221(1-2), 61-75 (1999)
7. [Dur02] Durand, B.: De la logique aux pavages. Theoretical Computer Science 281(1-2), 311-324 (2002)
8. [GS53] Gale, F., Stewart, F.M.: Infinite games with perfect information. Ann. Math. Studies 28, 245-266 (1953)
9. [Han74] Hanf, W.P.: Non-recursive tilings of the plane. I. Journal of Symbolic Logic 39(2), 283-285 (1974)
10. [LW07] Lafitte, G., Weiss, M.: Universal Tilings. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol. 4393, pp. 367-380. Springer, Heidelberg (2007)
11. [Mar75] Martin, D.A.: 1975. Annals of Math. 102, 363-371 (1975)
12. [Mye74] Myers, D.: Non-recursive tilings of the plane. II. Journal of Symbolic Logic 39(2), 286-294 (1974)
13. [Oxt57] Oxtoby, J.C.: Contribution to the theory of games, Vol. III. Ann. of Math. Studies 39, 159-163 (1957)
14. [Rob71] Robinson, R.: Undecidability and nonperiodicity for tilings of the plane. Inventiones Mathematicae 12, 177-209 (1971)
15. [Ser05] Serre, O.: Contribution á l'étude des jeux sur des graphes de processus á pile, PhD thesis, Université Paris VII (2005)
16. [Wan61] Wang, H.: Proving theorems by pattern recognition II. Bell System Technical Journal 40, 1-41 (1961)
17. [Wan62] Wang, H.: Dominoes and the AEA-case of the decision problem. In: Proceedings of the Symposium on Mathematical Theory of Automata, pp. 23-55 (1962)