Suffix Automata and Standard Sturmian Words

DOI10.1007/978-3-540-73208-2_36zbMath1202.68300OpenAlexW1509367123MaRDI QIDQ5428249

Marinella Sciortino, Luca Q. Zamboni

Publication date: 28 November 2007

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73208-2_36

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45)

Related Items (12)

On the structure of bispecial Sturmian words ⋮ The palindromization map ⋮ Bit catastrophes for the Burrows-Wheeler transform ⋮ String attractors and infinite words ⋮ A combinatorial view on string attractors ⋮ Characterization of Infinite LSP Words and Endomorphisms Preserving the LSP Property ⋮ Standard Sturmian words and automata minimization algorithms ⋮ Computing the number of cubic runs in standard Sturmian words ⋮ Special factors and the combinatorics of suffix and factor automata ⋮ Compressed string-matching in standard Sturmian words ⋮ Characteristic Sturmian words are extremal for the critical factorization theorem ⋮ Flexibility of the pressure function

This page was built for publication: Suffix Automata and Standard Sturmian Words