Abstract

We present a new framework for dealing with C∞C^{\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 C∞C^{\infty}-words through an infinite directed acyclic graph GG. This graph is defined by a map acting on the frontiers of C∞C^{\infty}-words. We show that this map can be defined recursively and with no explicit references to C∞C^{\infty}-words. We then show that some important conjectures on C∞C^{\infty}-words follow from analogous statements on the structure of the graph GG.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.