Wang tiles are unit size squares with colored edges. By using a fixed-point theorem à la Kleene for tilings we give novel proofs of classical results of tilings problems' undecidability by way of diagonalization on tilings (made possible by this theorem). Then, we present a general technique to construct aperiodic tile sets, i.e., tile sets that generate only aperiodic tilings of the plane. Our last construction generalizes the notion of self-simulation and makes possible the construction of tile sets that self-simulate via self-similar tilings, showing how complex the self-simulation can be. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Lafitte, G., & Weiss, M. (2009). Constructing new aperiodic self-simulating tile sets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5635 LNCS, pp. 300–309). https://doi.org/10.1007/978-3-642-03073-4_31
Mendeley helps you to discover research relevant for your work.