Skip to Main content Skip to Navigation
Journal articles

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

Gwenaël Richomme 1, 2 Patrice Séébold 1, 2 
1 ARITH - Arithmétique informatique
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
2 UPVM - Université Paul-Valéry - Montpellier 3
Abstract : Séébold (1998) announced that Sturmian words generated by morphisms are all rigid. There was a gap in the proof. This gap is corrected here to complete a combinatorial proof of this result.
Keywords : Sturmian words morphisms
Document type :
Journal articles
Complete list of metadata
https://hal-lirmm.ccsd.cnrs.fr/lirmm-00797672
Contributor : Gwenaël Richomme Connect in order to contact the contributor
Submitted on : Thursday, March 7, 2013 - 9:05:11 AM
Last modification on : Friday, August 5, 2022 - 10:45:46 AM

Links full text

openaccess

Identifiers

Collections

CNRS | UNIV-MONTP3 | INSMI | LIRMM | TDS-MACS | MIPS | UNIV-MONTPELLIER

Citation

Gwenaël Richomme, Patrice Séébold. Completing a combinatorial proof of the rigidity of Sturmian words generated by morphisms. Theoretical Computer Science, Elsevier, 2012, 428, pp.92-97. ⟨10.1016/j.tcs.2011.12.008⟩. ⟨lirmm-00797672⟩

Export

BibTeX TEI DC DCterms EndNote Datacite

Share

Metrics

Record views

84