A codicity undecidable problem in the plane

Authors:
Danièle Beauquier;Maurice Nivat
Affiliations:
Laboratory of Algorithmics, Complexity and Logic, Department of Informatics, University Paris-12, 61 Av. du Gén. de Gaulle, 94010 Créteil, France;LIAFA, Université Denis Diderot, Case 7014-2, place Jussieu F-75251, Paris Cedex 05, France
Venue:
Theoretical Computer Science - Special issue: Tilings of the plane
Year:
2003

Citing 4
Cited 3

Tilings and patterns

Tilings and patterns
Tiling the plane with one tile

SCG '90 Proceedings of the sixth annual symposium on Computational geometry
An undecidable problem about rational sets and contour words of polyominoes

Information Processing Letters
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

How Many Figure Sets Are Codes?

Language and Automata Theory and Applications
Directed figure codes with weak equality

IDEAL'10 Proceedings of the 11th international conference on Intelligent data engineering and automated learning
Directed figure codes: decidability frontier

COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics

Quantified Score

Hi-index	0.00

Visualization

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.