Quasiperiodic Sturmian words and morphisms

DOI10.1016/j.tcs.2006.10.034zbMath1108.68097OpenAlexW2040156800MaRDI 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 wordsquasiperiodicitymorphismsLyndon words

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (11)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: Quasiperiodic Sturmian words and morphisms