Tilings: Recursivity and regularity

Theoretical Computer Science

Volumn 310, Issue 1-3, 2004, Pages 469-477

  Cervelle, Julien ^a   Durand, Bruno ^a  

^a AIX MARSEILLE UNIV   (France)

Author keywords

Quasiperiodicity; Recursivity; Tilings

Indexed keywords

DECISION THEORY; RECURSIVE FUNCTIONS; SET THEORY; THEOREM PROVING;

QUASIPERIODICITY;

COMPUTER SCIENCE;

EID: 0242523856     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(03)00242-1     Document Type: Article

References (20)

1. C. Allauzen, B. Durand, Appendix A: Tiling Problems, The Classical Decision Problem, Springer, Berlin, 1996, pp. 407-420.
2. Berger R. The undecidability of the domino problem. Mem. Amer. Math. Soc. 66:1966.
3. Börger E., Grädel E., Gurevich Y. The Classical Decision Problem. 1996;Springer, Berlin.
4. J. Cervelle, B. Durand, Tilings: recursivity and regularity, in: STACS'00, Lecture Notes in Computer Science, Vol. 1770, Springer, Berlin, 2000, pp. 491-502.
5. Durand B. Inversion of 2D cellular automata. some complexity results Theoret. Comput. Sci. 134:1994;387-401.
6. Durand B. The surjectivity problem for 2D cellular automata. J. Comput. Systems Sci. 49(3):1994;718-725.
7. Durand B. A Random NP-complete problem for inversion of 2D cellular automata. Theoret. Comput. Sci. 148(1):1995;19-32.
8. B. Durand, Tilings and quasiperiodicity, in: ICALP'97, Lecture Notes in Computer Science, Vol. 1256, Springer, Berlin, July 1997, pp. 65-75.
9. Durand B. Tilings and quasiperiodicity. Theoret. Comput. Sci. 221(1-2):1999;61-75.
10. Furstenberg H. Recurrence in Ergodic Theory and Combinatorial Number Theory. 1981;Princeton University Press, Princeton, NJ.
11. Gurevich Y. Average case completeness. J. Comput. System Sci. 42:1991;346-398.
12. Gurevich Y., Koriakov I. A remark on Berger's paper on the domino problem. Siberian J. Math. 13:1972;459-463. (in Russian).
13. K. Ingersent, Matching Rules for Quasicrystalline Tilings, World Scientific, Singapore, 1991, pp. 185-212.
14. Kari J. Reversibility and surjectivity problems of cellular automata. J. Comput. System Sci. 48:1994;149-182.
15. Levin L. Average case complete problems. SIAM J. Comput. 15(1):1986;285-286.
16. Robinson R.M. Undecidability and nonperiodicity for tilings of the plane. Invent. Math. 12:1971;177-209.
17. Róka Zs. Simulations between cellular automata on Cayley graphs. Theoret. Comput. Sci. 225:1999;81-111.
18. P. van Emde Boas, The convenience of tilings, in: Complexity, Logic and Recursion Theory, Lecture Notes in Pure and Applied Mathematics, Vol. 187, 1997, pp. 331-363.
19. Wang H. Proving theorems by pattern recognition II. Bell System Tech. J. 40:1961;1-41.
20. H. Wang, Dominoes and the ∀∃∀ -case of the decision problem, in: Proc. Symp. on Mathematical Theory of Automata, Brooklyn Polytechnic Institute, New York, 1962, pp. 23-55.