Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2007

On morphisms preserving infinite Lyndon words

Abstract

In a previous paper, we characterized free monoid morphisms preserving finite Lyndon words. In particular, we proved that such a morphism preserves the order on finite words. Here we study morphisms preserving infinite Lyndon words and morphisms preserving the order on infinite words. We characterize them and show relations with morphisms preserving Lyndon words or the order on finite words. We also briefly study morphisms preserving border-free words and those preserving the radix order.
Fichier principal
Vignette du fichier
659-2282-1-PB.pdf (212.84 Ko) Télécharger le fichier
Origin Explicit agreement for this submission
Loading...

Dates and versions

hal-00599743 , version 1 (03-06-2014)

Identifiers

Cite

Gwenaël Richomme. On morphisms preserving infinite Lyndon words. Discrete Mathematics and Theoretical Computer Science, 2007, Vol. 9 no. 2 (2), pp.89-108. ⟨10.46298/dmtcs.411⟩. ⟨hal-00599743⟩
94 View
856 Download

Altmetric

Share

More