Paper Info
Title
A codicity undecidable problem in the plane
Abstract
In this paper we give a new undecidability result about tiling problems. Given a finite set of polyomino types, the problem whether this set is a code, is undecidable. The same result holds for dominoes.
Year
DOI
Venue
2003
10.1016/S0304-3975(03)00029-X
Theor. Comput. Sci.
Keywords
DocType
Volume
Polyomino,Tiling,new undecidability result,polyomino type,codicity undecidable problem,finite set,Code,Undecidability,tiling problem,Domino tiling
Journal
303
Issue
ISSN
Citations 
2-3
Theoretical Computer Science
5
PageRank 
References 
Authors
0.53
2
2
Name
Order
Citations
PageRank
Danièle Beauquier128431.44
Maurice Nivat21261277.74