Abstract
Wang tiles are unit size squares with colored edges. In this paper, we approach one aspect of the study of tilings computability: the quest for a universal tile set. Using a complex construction, based on Robinson’s classical construction and its different modifications, we build a tile set μ (pronounced ayin) which almost always simulates any tile set. By way of Banach-Mazur games on tilings topological spaces, we prove that the set of μ-tilings which do not satisfy the universality condition is meager in the set of μ-tilings.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Allauzen, C., Durand, B.: Appendix A: Tiling problems. The classical decision problem, 407–420 (1996)
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)
Berger, R.: The undecidability of the domino problem. Mem. Amer. Math Soc. 66, 1–72 (1966)
Durand, B., Levin, L.A., Shen, A.: Complex tilings. In: STOC, pp. 732–739 (2001)
Durand, B., Levin, L.A., Shen, A.: Local rules and global order. Mathematical Intelligencer 27(1), 64–68 (2004)
Durand, B., Romashchenko, A.E., Shen, A.: Fixed point and aperiodic tilings. In: Developments in Language Theory, pp. 276–288 (2008)
Hanf, W.P.: Nonrecursive tilings of the plane. I. J. Symb. Log 39(2), 283–285 (1974)
Lafitte, G., Weiss, M.: Universal tilings. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol. 4393, pp. 367–380. Springer, Heidelberg (2007)
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)
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)
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)
Myers, D.: Nonrecursive tilings of the plane. II. J. Symb. Log 39(2), 286–294 (1974)
Oxtoby, J.C.: Tilings: recursivity and regularity. Contribution to the theory of games III(39), 159–163 (1957)
Robinson, R.M.: Undecidability and nonperiodicity for tilings of the plane. Inv. Math. 12, 117–209 (1971)
Wang, H.: Proving theorems by pattern recognition II. Bell Systems Journal 40, 1–41 (1961)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lafitte, G., Weiss, M. (2009). An Almost Totally Universal Tile Set. In: Chen, J., Cooper, S.B. (eds) Theory and Applications of Models of Computation. TAMC 2009. Lecture Notes in Computer Science, vol 5532. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02017-9_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-02017-9_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02016-2
Online ISBN: 978-3-642-02017-9
eBook Packages: Computer ScienceComputer Science (R0)