pith. sign in

arxiv: 1705.05786 · v1 · pith:WSN45LGKnew · submitted 2017-05-16 · 💻 cs.FL

A Characterization of Infinite LSP Words

classification 💻 cs.FL
keywords infinitewordsfiniteautomatononlywordadicadicity
0
0 comments X
read the original abstract

G. Fici proved that a finite word has a minimal suffix automaton if and only if all its left special factors occur as prefixes. He called LSP all finite and infinite words having this latter property. We characterize here infinite LSP words in terms of $S$-adicity. More precisely we provide a finite set of morphisms $S$ and an automaton ${\cal A}$ such that an infinite word is LSP if and only if it is $S$-adic and all its directive words are recognizable by ${\cal A}$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.