Skip to Main content Skip to Navigation
Journal articles

Vertical Representation of C∞-words

Jean-Marc Fedou 1 Gabriele Fici 1
1 Laboratoire d'Informatique, Signaux, et Systèmes de Sophia-Antipolis (I3S) / Equipe MC3
Laboratoire I3S - MDSC - Modèles Discrets pour les Systèmes Complexes
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.
Complete list of metadata
Contributor : Jean-Marc Fedou <>
Submitted on : Friday, May 20, 2016 - 7:43:01 AM
Last modification on : Friday, January 8, 2021 - 11:22:05 AM

Links full text




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



Record views