Vertical representation of C^-words

Abstract: We present a new framework for dealing with

C^{i n f t y}

-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^{i n f t y}

-words through an infinite directed acyclic graph

G

. This graph is defined by a map acting on the frontiers of

C^{i n f t y}

-words. We show that this map can be defined recursively and with no explicit references to

C^{i n f t y}

-words. We then show that some important conjectures on

C^{i n f t y}

-words follow from analogous statements on the structure of the graph

G

.

Recommendations

Cites Work

Cited In (1)

This page was built for publication: Vertical representation of \(\mathbf{C}^\infty\)-words