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.
https://hal-lirmm.ccsd.cnrs.fr/lirmm-00797672
Contributeur : Gwenaël Richomme
<>
Soumis le : jeudi 7 mars 2013 - 09:05:11
Dernière modification le : jeudi 24 mai 2018 - 15:59:21
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〉
