Michal Kolarz ; Wlodzimierz Moczurad - Directed figure codes are decidable

dmtcs:455 - Discrete Mathematics & Theoretical Computer Science, January 1, 2009, Vol. 11 no. 2 - https://doi.org/10.46298/dmtcs.455
Directed figure codes are decidableArticle

Authors: Michal Kolarz 1; Wlodzimierz Moczurad 1

  • 1 Institute of Computer Science [Krakow]

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.

Volume: Vol. 11 no. 2
Section: Automata, Logic and Semantics
Published on: January 1, 2009
Imported on: March 26, 2015
Keywords: [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

Consultation statistics

This page has been seen 417 times.
This article's PDF has been downloaded 572 times.