Vertical Representation of C∞-words

Abstract : We present a new framework for dealing with C∞-words, based on their left and right frontiers. This allows us to give a compact representation of them, and to describe the set of C∞-words through an infinite directed acyclic graph G. This graph is defined by a map acting on the frontiers of C∞-words. We show that this map can be defined recursively and with no explicit reference to C∞-words. We then show that some important conjectures on C∞-words follow from analogous statements on the structure of the graph G.
Type de document :
Article dans une revue
Theoretical Computer Science, Elsevier, 2015, 565
Liste complète des métadonnées
Contributeur : Jean-Marc Fedou <>
Soumis le : vendredi 20 mai 2016 - 07:43:01
Dernière modification le : lundi 4 décembre 2017 - 15:14:11




Jean-Marc Fedou, Gabriele Fici. Vertical Representation of C∞-words. Theoretical Computer Science, Elsevier, 2015, 565. 〈hal-01318802〉



Consultations de la notice