Skip to Main content Skip to Navigation
Reports

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
Abstract : In the paper "On the conjugation of standard morphisms, Theoret. Comput. Sci. 195 (1998), 91-109", Séébold 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.
Complete list of metadata

Cited literature [7 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00512187
Contributor : Patrice Séébold <>
Submitted on : Friday, August 27, 2010 - 4:54:00 PM
Last modification on : Thursday, June 10, 2021 - 5:11:06 PM
Long-term archiving on: : Tuesday, October 23, 2012 - 3:15:36 PM

File

Complement_rigid_V_Hal.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : lirmm-00512187, version 1

Citation

Gwenaël Richomme, Patrice Séébold. Completing a Combinatorial Proof of the Rigidity of Sturmian Words Generated by Morphisms. [Research Report] RR-10030, Lirmm. 2010. ⟨lirmm-00512187⟩

Share

Metrics

Record views

533

Files downloads

325