Tiling the Plane with a Fixed Number of Polyominoes

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.

• Type: Conference
• Year: 2009
• Where: LATA
• Authors: Nicolas Ollinger
• Keywords: Automata Theory, Domino Problem, LATA 2009, finite Set