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.
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⟩