Completing a combinatorial proof of the rigidity of Sturmian words generated by morphisms

DOI10.1016/j.tcs.2011.12.008zbMath1248.68396OpenAlexW2027342596MaRDI QIDQ418752

Patrice Séébold, Gwenaël Richomme

Publication date: 30 May 2012

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

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

zbMATH Keywords

rigiditySturmian wordsSturmian morphisms

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (4)

On Sturmian substitutions closed under derivation ⋮ A counterexample to a question of Hof, Knill and Simon ⋮ Sturmian images of non Sturmian words and standard morphisms ⋮ Rigidity and Substitutive Dendric Words

Cites Work

• Unnamed Item
• On stabilizers of infinite words
• On the conjugation of standard morphisms
• Conjugacy and episturmian morphisms.
• Some remarks about stabilizers
• Syndeticity and independent substitutions
• Invertible Substitutions with a Common Periodic Point

This page was built for publication: Completing a combinatorial proof of the rigidity of Sturmian words generated by morphisms