Lyndon morphisms

Gwenaël Richomme (1)

1 LaRIA - Laboratoire de Recherche en Informatique d'Amiens

We characterize Lyndon morphisms (that is free monoids morphisms that preserve finite Lyndon words) and morphisms that preserve lexicographic order between finite words. We prove that the monoids of these morphisms are not finitely generated. We end characterizing the episturmian morphisms that are Lyndon morphisms and those that are order-preserving.

Mots clés: Combinatorics on words; morphisms; Lyndon words; Sturmian morphisms; lexicographic order

Domaines: Mathématique discrète [cs.DM]

Gwenaël Richomme. Lyndon morphisms. Bulletin of the Belgian Mathematical Society - Simon Stevin, 2003, 10 (5), pp.761-785. ⟨hal-00598219⟩