Suffix Automata and Standard Sturmian Words

DOI10.1007/978-3-540-73208-2_36MaRDI QIDQ5428249zbMATH OpenOpenAlexFDO

Authors M. 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

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

Recommendations

• Combinatorics of Finite Words and Suffix Automata
• Special factors and the combinatorics of suffix and factor automata
• Standard Sturmian words and automata minimization algorithms
• On the Suffix Automaton with Mismatches
• Usefulness of directed acyclic subword graphs in problems related to standard Sturmian words

Cited in

(15)

• Flexibility of the pressure function
• A combinatorial view on string attractors
• Compressed string-matching in standard Sturmian words
• On the structure of bispecial Sturmian words
• Combinatorics of Finite Words and Suffix Automata
• Standard Sturmian words and automata minimization algorithms
• Computing the number of cubic runs in standard Sturmian words
• Characterization of infinite LSP words and endomorphisms preserving the LSP property
• Special factors and the combinatorics of suffix and factor automata
• The palindromization map
• Bit catastrophes for the Burrows-Wheeler transform
• String attractors and infinite words
• New string attractor-based complexities for infinite words
• Bit catastrophes for the Burrows-Wheeler transform
• Characteristic Sturmian words are extremal for the critical factorization theorem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5428249)