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

Gwenaël Richomme; Patrice Séébold

doi:10.1016/j.tcs.2011.12.008

Back

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

Journal article

Open access

Peer reviewed

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

Gwenaël Richomme and Patrice Séébold

Theoretical Computer Science, Vol.428, pp.92-97

2012

DOI: https://doi.org/10.1016/j.tcs.2011.12.008

Abstract

Sturmian words

morphisms

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.

Files and links (2)

url

Find in HALView

url

https://doi.org/10.1016/j.tcs.2011.12.008View

Published (Version of record) Open

Metrics

1 Record Views

Details

Title: Completing a combinatorial proof of the rigidity of Sturmian words generated by morphisms
Creators - without role: Gwenaël Richomme - Université de Montpellier
Patrice Séébold - Université de Montpellier
Publication Details: Theoretical Computer Science, Vol.428, pp.92-97
Identifiers: 9936320709311
Academic Unit: Laboratoire d'Informatique de Robotique et de Microélectronique de Mtp - LIRMM
Language: English
Resource Type: Journal article
Local Fields: lirmm-00797672