Lyndon morphisms
Richomme, G.
Bull. Belg. Math. Soc. Simon Stevin, Tome 10 (2003) no. 1, p. 761-785 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
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.
Publié le : 2003-12-14
Classification:  Combinatorics on words,  morphisms,  Lyndon words,  Sturmian morphisms,  lexicographic order,  68R15 
@article{1074791331,
     author = {Richomme, G.},
     title = {Lyndon morphisms},
     journal = {Bull. Belg. Math. Soc. Simon Stevin},
     volume = {10},
     number = {1},
     year = {2003},
     pages = { 761-785},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1074791331}
}

Richomme, G. Lyndon morphisms. Bull. Belg. Math. Soc. Simon Stevin, Tome 10 (2003) no. 1, pp.  761-785. http://gdmltest.u-ga.fr/item/1074791331/