Quasiperiodic Sturmian words and morphisms

DOI10.1016/j.tcs.2006.10.034zbMath1108.68097MaRDI QIDQ870835

N. E. Zubov

Publication date: 15 March 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.10.034

zbMATH Keywords

Sturmian words; quasiperiodicity; morphisms; Lyndon words

Mathematics Subject Classification ID

68R15: Combinatorics on words

Related Items

Episturmian words: a survey, Characterization of Infinite LSP Words and Endomorphisms Preserving the LSP Property, Minimal critical exponent of quasiperiodic words, Optimality of some algorithms to detect quasiperiodicities, A characterization of binary morphisms generating Lyndon infinite words, On sets of indefinitely desubstitutable words, Quasiperiods of biinfinite words, Quasiperiodic and Lyndon episturmian words, Coverability and multi-scale coverability on infinite pictures, Coverability in Two Dimensions, Directive words of episturmian words: equivalences and normalization

Cites Work

• Efficient detection of quasiperiodicities in strings
• Optimal superprimitivity testing for strings
• Fibonacci morphisms and Sturmian words
• Complexity of sequences and dynamical systems
• Infinite Lyndon words
• Conjugacy and episturmian morphisms.
• Lyndon morphisms
• Initial powers of Sturmian sequences
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item