Tilings and quasiperiodicity

Theoretical Computer Science

Volumn 221, Issue 1-2, 1999, Pages 61-75

  Durand, Bruno ^a  

^a UNIVERSITÉ DE LYON   (France)

Author keywords

2D words; Combinatorics; Quasiperiodicity; Tilings

Indexed keywords

EID: 0002213684     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00027-4     Document Type: Article

References (20)

1. C. Allauzen, B. Durand, Appendix A: Tiling problems, in: E. Borger, E. Gradel, Y. Gurevich (Eds.), The Classical Decision Problem, 1996, pp. 407-420.
2. R. Berger, The undecidability of the domino problem, Mem. Am. Math. Soc. 66, 1966.
3. E. Börger, E. Grädel, Y. Gurevich, The Classical Decision Problem, Springer, Berlin, 1996.
4. T.C. Brown, Description of the characteristic sequence of an irrational, Canad. Math. Bull. 36 (1993) 15-21.
5. K. Culik, An aperiodic set of 13 Wang tiles, Discrete Math. 160 (1996) 245-251.
6. A. de Luca, Sturmian words: structure, combinatorics, and their arithmetics, Theoret. Comput. Sci. 183(1) (1997) 45-82.
7. A. de Luca, S. Varricchio, Handbook of Formal Languages, vol. 1, Chapter Regularity and Finiteness Conditions, Springer, Berlin, 1997, pp. 747-810.
8. N. Dolbilin, The countability of a tiling family and the periodicity of a tiling, Discrete Comput. Geom. 13 (1995) 405-414.
9. B. Durand, Self-similarity viewed as a local property via tile sets, MFCS'96, number 1113 in Lecture Notes in Computer Science, Springer, Berlin, 1996, pp. 312-323.
10. H. Furstenberg, Recurrence in Ergodic Theory and Combinatorial Number Theory, Princetown University Press, Princeton, NJ, 1981.
11. Y. Gurevich, I. Koriakov, A remark on Berger's paper on the domino problem, Siberian J. Math. 13 (1972) 459-463 (in Russian).
12. K. Ingersent, Matching Rules for Quasicrystalline Tilings, World Scientific, Singapore, 1991, pp. 185-212.
13. J. Kari, A small aperiodic set of Wang tiles, Discrete Math. 160 (1996) 259-264.
14. L.S. Levitov, Commun. Math. Phys. 119 (1988) 627.
15. M. Nivat, D. Perrin, Automata on Infinite Words, Lecture Notes in Computer Science, vol. 192, Springer, Berlin, 1985.
16. M. Nivat, D. Perrin, Ensembles reconnaissables de mots biinfinis, Canadian J. Math. 38 (1986) 513-537.
17. D. Perrin, J-E. Pin, Mots Infinis, book in preparation.
18. R.M. Robinson, Undecidability and nonperiodicity for tilings of the plane, Invent. Math. 12 (1971) 177-209.
19. P. Séébold, On the conjugation of standard morphisms, MFCS'96, Lecture Notes in Computer Science, vol. 113, 1996, pp. 506-516.
20. H. Wang, Proving theorems by pattern recognition II, Bell System Tech. J. 40 (1961) 1-41.