Vertical Representation of C∞-words - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 2015

Vertical Representation of C∞-words

Résumé

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.

Dates et versions

hal-01318802 , version 1 (20-05-2016)

Identifiants

Citer

Jean-Marc Fedou, Gabriele Fici. Vertical Representation of C∞-words. Theoretical Computer Science, 2015, 565. ⟨hal-01318802⟩
82 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More