A Characterization of Infinite LSP Words

Gwenaël Richomme 1, 2
2 ESCAPE - Systèmes complexes, automates et pavages
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
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}$.
Document type :
Conference papers
Complete list of metadatas

Contributor : Gwenaël Richomme <>
Submitted on : Wednesday, September 13, 2017 - 10:54:46 PM
Last modification on : Thursday, May 24, 2018 - 3:59:23 PM

Links full text




Gwenaël Richomme. A Characterization of Infinite LSP Words. DLT: Developments in Language Theory, Aug 2017, Liège, Belgium. pp.320-331, ⟨10.1007/978-3-319-62809-7_24⟩. ⟨lirmm-01587263⟩



Record views