A codicity undecidable problem in the pl
β
Danièle Beauquier; Maurice Nivat
π
Article
π
2003
π
Elsevier Science
π
English
β 295 KB
In this paper we give a new undecidability result about tiling problems. Given a ΓΏnite set of polyomino types, the problem whether this set is a code, is undecidable. The same result holds for dominoes.