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.
Type de document :
Article dans une revue
Discrete Mathematics and Theoretical Computer Science, DMTCS, 2009, 11 (2), pp.1--14
Liste complète des métadonnées

Littérature citée [12 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00988215
Contributeur : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Soumis le : mercredi 7 mai 2014 - 15:58:36
Dernière modification le : mercredi 29 novembre 2017 - 10:26:16
Document(s) archivé(s) le : jeudi 7 août 2014 - 11:40:50

Fichier

1106-4263-1-PB.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00988215, version 1

Collections

Citation

Michal Kolarz, Wlodzimierz Moczurad. Directed figure codes are decidable. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2009, 11 (2), pp.1--14. 〈hal-00988215〉

Partager

Métriques

Consultations de la notice

328

Téléchargements de fichiers

319