Tiling the Plane with a Fixed Number of Polyominoes
- Cite this paper as:
- Ollinger N. (2009) Tiling the Plane with a Fixed Number of Polyominoes. In: Dediu A.H., Ionescu A.M., Martín-Vide C. (eds) Language and Automata Theory and Applications. LATA 2009. Lecture Notes in Computer Science, vol 5457. Springer, Berlin, Heidelberg
Deciding whether a finite set of polyominoes tiles the plane is undecidable by reduction from the Domino problem. In this paper, we prove that the problem remains undecidable if the set of instances is restricted to sets of 5 polyominoes. In the case of tiling by translations only, we prove that the problem is undecidable for sets of 11 polyominoes.
Unable to display preview. Download preview PDF.