Abstract
The tiling problem is the decision problem to determine if a given finite collection of Wang tiles admits a valid tiling of the plane. In this work we give a new proof of this fact based on tiling simulations of certain piecewise affine transformations. Similar proof is also shown to work in the hyperbolic plane, thus answering an open problem posed by R.M.Robinson 1971 [9]. © Springer-Verlag Berlin Heidelberg 2008.
Cite
CITATION STYLE
Kari, J. (2008). On the undecidability of the tiling problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4910 LNCS, pp. 74–82). Springer Verlag. https://doi.org/10.1007/978-3-540-77566-9_7
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
