6533b874fe1ef96bd12d60dc
RESEARCH PRODUCT
Vertical representation of C∞-words
Jean-marc FédouGabriele Ficisubject
Left and rightDiscrete mathematicsGeneral Computer ScienceComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)16. Peace & justiceDirected acyclic graphTheoretical Computer ScienceCombinatoricsDirected setRecursive functionsGraph (abstract data type)Null graphComputer Science::Formal Languages and Automata TheoryMathematicsofComputing_DISCRETEMATHEMATICSMathematicsdescription
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.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2015-02-01 | Theoretical Computer Science |