Completing a Combinatorial Proof of the Rigidity of Sturmian Words Generated by Morphisms - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Reports (Research Report) Year : 2010

Completing a Combinatorial Proof of the Rigidity of Sturmian Words Generated by Morphisms

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.
Fichier principal
Vignette du fichier
Complement_rigid_V_Hal.pdf (124.47 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

lirmm-00512187 , version 1 (27-08-2010)

Identifiers

  • HAL Id : lirmm-00512187 , version 1

Cite

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⟩
336 View
161 Download

Share

Gmail Facebook X LinkedIn More