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

DOI10.1016/J.TCS.2011.12.008MaRDI QIDQ418752zbMATH OpenOpenAlexFDO

Authors Gwénaël Richomme, Patrice Séébold

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)

Recommendations

• Sturmian morphisms and Rauzy's rules
• scientific article; zbMATH DE number 1333603
• A little more about morphic Sturmian words
• Sturmian morphisms and \(\alpha\)-words
• Sturmian morphisms

Cites work

• scientific article; zbMATH DE number 1737190 (Why is no real title available?)
• Conjugacy and episturmian morphisms.
• Invertible Substitutions with a Common Periodic Point
• On stabilizers of infinite words
• On the conjugation of standard morphisms
• Some remarks about stabilizers
• Syndeticity and independent substitutions

Cited in

(7)

• scientific article; zbMATH DE number 17555 (Why is no real title available?)
• A counterexample to a question of Hof, Knill and Simon
• Conjugates of characteristic Sturmian words generated by morphisms
• Rigidity and substitutive dendric words
• Conjugacy of morphisms and Lyndon decomposition of standard Sturmian words
• On Sturmian substitutions closed under derivation
• Sturmian images of non Sturmian words and standard morphisms

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

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