Journal Articles Theoretical Computer Science Year : 2012

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

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.

Domains

Discrete Mathematics [cs.DM] Combinatorics [math.CO]

Gwenaël Richomme  : Connect in order to contact the contributor

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00797672

Submitted on : Thursday, March 7, 2013-9:05:11 AM

Last modification on : Wednesday, January 8, 2025-3:28:03 PM

Consult the full text

Dates and versions

lirmm-00797672 , version 1 (07-03-2013)

Identifiers

Cite

Gwenaël Richomme, Patrice Séébold. Completing a combinatorial proof of the rigidity of Sturmian words generated by morphisms. Theoretical Computer Science, 2012, 428, pp.92-97. ⟨10.1016/j.tcs.2011.12.008⟩. ⟨lirmm-00797672⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

CNRS UNIV-MONTP3 LIRMM TDS-MACS MIPS UNIV-MONTPELLIER AMIS
93 View
0 Download

Altmetric

Share

More