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 -words, based on their left and right frontiers. This allows us to give a compact representation of them, and to describe the set of -words through an infinite directed acyclic graph . This graph is defined by a map acting on the frontiers of -words. We show that this map can be defined recursively and with no explicit references to -words. We then show that some important conjectures on -words follow from analogous statements on the structure of the graph .
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