Chapter

Language and Automata Theory and Applications

Volume 5457 of the series Lecture Notes in Computer Science pp 638-647

Tiling the Plane with a Fixed Number of Polyominoes

  • Nicolas OllingerAffiliated withLancaster UniversityLaboratoire d’informatique fondamentale de Marseille (LIF), Aix-Marseille Université, CNRS

* Final gross prices may vary according to local VAT.

Get Access

Abstract

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.