Skip to Main content Skip to Navigation
Journal articles

Directed figure codes are decidable

Abstract : Two-dimensional structures of various kinds can be viewed as generalizations of words. Codicity verification and the defect effect, important properties related to word codes, are studied also in this context. Unfortunately, both are lost in the case of two common structures, polyominoes and figures. We consider directed figures defined as labelled polyominoes with designated start and end points, equipped with catenation operation that uses a merging function to resolve possible conflicts. We prove that in this setting verification whether a given finite set of directed figures is a code is decidable and we give a constructive algorithm. We also clarify the status of the defect effect for directed figures.
Document type :
Journal articles
Complete list of metadata

Cited literature [12 references]  Display  Hide  Download

https://hal.inria.fr/hal-00988215
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s Connect in order to contact the contributor
Submitted on : Wednesday, May 7, 2014 - 3:58:36 PM
Last modification on : Tuesday, December 7, 2021 - 3:33:14 PM
Long-term archiving on: : Thursday, August 7, 2014 - 11:40:50 AM

File

1106-4263-1-PB.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Michal Kolarz, Wlodzimierz Moczurad. Directed figure codes are decidable. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2009, Vol. 11 no. 2 (2), pp.1--14. ⟨10.46298/dmtcs.455⟩. ⟨hal-00988215⟩

Share

Metrics

Record views

67

Files downloads

834