Directed figure codes: decidability frontier

Authors:
Michał Kolarz
Affiliations:
Institute of Computer Science, Jagiellonian University, Kraków, Poland
Venue:
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Year:
2010

Citing 5
Cited 0

Polyomino tilings, cellular automata and codicity

Theoretical Computer Science
Codes and equations on trees

Theoretical Computer Science
Theory of Codes

Theory of Codes
A codicity undecidable problem in the plane

Theoretical Computer Science - Special issue: Tilings of the plane
Adding symbolic information to picture models: definitions and properties

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider directed figures defined as labelled polyominoes with designated start and end points, with a partial catenation. As we are interested in codicity verification for sets of figures, we show that it is decidable for sets of figures with parallel translation vectors, which is one of the decidability border cases in this setting. We give a constructive proof which leads to a straightforward algorithm.