1 research outputs found
Vertical representation of -words
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 .Comment: Published in Theoretical Computer Scienc