An almost totally universal tile set

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

Volumn 5532 LNCS, Issue , 2009, Pages 271-280

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

^a AIX MARSEILLE UNIVERSITY   (France)

^b UNIVERSITY OF MILANO BICOCCA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX CONSTRUCTION; ROBINSON; TOPOLOGICAL SPACES; WANG TILES;

BUILDING MATERIALS;

GAME THEORY;

EID: 67650221135     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02017-9_30     Document Type: Conference Paper

References (15)

1. Allauzen, C., Durand, B.: Appendix A: Tiling problems. The classical decision problem, 407-420 (1996).
2. Ballier, A., Durand, B., Jeandel, E.: Structural aspects of tilings. In: Proceeding of the Symposium on Theoretical Aspects of Computer Science, pp. 61-72 (2008).
3. Berger, R.: The undecidability of the domino problem. Mem. Amer. Math Soc. 66, 1-72 (1966).
4. Durand, B., Levin, L.A., Shen, A.: Complex tilings. In: STOC, pp. 732-739 (2001).
5. Durand, B., Levin, L.A., Shen, A.: Local rules and global order. Mathematical Intelligencer 27(1), 64-68 (2004).
6. Durand, B., Romashchenko, A.E., Shen, A.: Fixed point and aperiodic tilings. In: Developments in Language Theory, pp. 276-288 (2008).
7. Hanf,W.P.: Nonrecursive tilings of the plane. I. J. Symb. Log 39(2), 283-285 (1974).
8. Lafitte, G., Weiss, M.: Universal tilings. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol. 4393, pp. 367-380. Springer, Heidelberg (2007).
9. Lafitte, G., Weiss, M.: Simulations between tilings. In: Beckmann, A., Dimitracopoulos, C., Löwe, B. (eds.) Logic and Theory of Algorithms, 4th Conference on Computability in Europe, CiE 2008, Athens, Greece, June 2008, University of Athens (2008).
10. Lafitte, G., Weiss, M.: Computability of tilings. In: International Federation for Information Processing, Fifth IFIP International Conference on Theoretical Computer Science, vol. 273, pp. 187-201 (2008).
11. Lafitte, G., Weiss, M.: A topological study of tilings. In: Agrawal, M., Du, D.-Z., Duan, Z., Li, A. (eds.) TAMC 2008. LNCS, vol. 4978, pp. 375-387. Springer, Heidelberg (2008).
12. Myers, D.: Nonrecursive tilings of the plane. II. J. Symb. Log 39(2), 286-294 (1974).
13. Oxtoby, J.C.: Tilings: recursivity and regularity. Contribution to the theory of games III(39), 159-163 (1957).
14. Robinson, R.M.: Undecidability and nonperiodicity for tilings of the plane. Inv. Math. 12, 117-209 (1971).
15. Wang, H.: Proving theorems by pattern recognition II. Bell Systems Journal 40, 1-41 (1961).