English

Vertical representation of $C^{\infty}$-words

Discrete Mathematics 2014-12-22 v3 Formal Languages and Automata Theory

Abstract

We present a new framework for dealing with CC^{\infty}-words, based on their left and right frontiers. This allows us to give a compact representation of them, and to describe the set of CC^{\infty}-words through an infinite directed acyclic graph GG. This graph is defined by a map acting on the frontiers of CC^{\infty}-words. We show that this map can be defined recursively and with no explicit references to CC^{\infty}-words. We then show that some important conjectures on CC^{\infty}-words follow from analogous statements on the structure of the graph GG.

Keywords

Cite

@article{arxiv.1202.5154,
  title  = {Vertical representation of $C^{\infty}$-words},
  author = {Jean-Marc Fédou and Gabriele Fici},
  journal= {arXiv preprint arXiv:1202.5154},
  year   = {2014}
}

Comments

Published in Theoretical Computer Science

R2 v1 2026-06-21T20:23:56.751Z