Tilings: Recursivity and regularity

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

Volumn 1770, Issue , 2000, Pages 491-502

  Cervelle, Julien ^a   Durand, Bruno ^a  

^a UNIVERSITÉ DE PROVENCE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

NON-TRIVIAL; QUASI-PERIODICITIES; RECURSIVITY;

RECURSIVE FUNCTIONS;

EID: 0003343594     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/3-540-46541-3_41     Document Type: Article

References (20)

1. C. Allauzen and B. Durand. Appendix A: “Tiling problems". The classical deci- sion problem (see [3]), pages 407-420, 1996.
2. R. Berger. The undecidability of the domino problem. Memoirs of the American Mathematical Society, 66, 1966.
3. E. Börger, E. Grädel, and Y. Gurevich. The classical decision problem. Springer- Verlag, 1996.
4. M. Delorme and J. Mazoyer, editors. Cellular automata: a Parallel model. Kluwer, 1999.
5. B. Durand. Inversion of 2d cellular automata: some complexity results. Theoretical Computer Science, 134:387-401, 1994.
6. B. Durand. The surjectivity problem for 2D cellular automata. Journal of Com- puter and Systems Science, 49(3):718-725, 1994.
7. B. Durand. A Random NP-complete problem for inversion of 2D cellular automata. Theoretical Computer Science, 148(1):19-32, 1995.
8. B. Durand. Tilings and quasiperiodicity. In ICALP'97, volume 1256 of Lecture Notes in Computer Science, pages 65-75. Springer Verlag, July 1997.
9. B. Durand. Tilings and quasiperiodicity. Theoretical Computer Science, 221:61-75, 1999.
10. H. Furstenberg. Recurrence in ergodic theory and combinatorial number theory. Princetown University Press, 1981.
11. Y. Gurevich. Average case completeness. Journal of Computer and System Sci- ences, 42:346-398, 1991.
12. Y. Gurevich and I. Koriakov. A remark on Berger's paper on the domino problem. Siberian Journal of Mathematics, 13:459-463, 1972. (in Russian).
13. K. Ingersent. Matching rules for quasicrystalline tilings, pages 185-212. World Scientific, 1991.
14. J. Kari. Reversibility and surjectivity problems of cellular automata. Journal of Computer and System Sciences, 48:149-182, 1994.
15. J. Kari. Rice's theorem for the limit set of cellular automata. Theoretical Com- puter Science, 127(2):229-254, 1994.
16. L. Levin. Average case complete problems. SIAM J. Comput, 15(1):285-286, February 1986.
17. R.M. Robinson. Undecidability and nonperiodicity for tilings of the plane. Inven- tiones Mathematicae, 12:177-209, 1971.
18. P. van Embde Boas. Dominoes are forever. Research report 83-04, University of Amsterdam. Department of Mathematics., 1983.
19. H. Wang. Proving theorems by pattern recognition II. Bell System Technical Journal, 40:1-41, 1961.
20. H. Wang. Dominoes and the 898-case of the decision problem. In Proc. Symp. on Mathematical Theory of Automata, pages 23-55. Brooklyn Polytechnic Institute, New York, 1962.