Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. On morphisms preserv ...
Article

On morphisms preserving infinite Lyndon words

Gwenaël Richomme ORCID (1)
(1) Laboratoire de Recherche en Informatique d'Amiens
Download article
Open on HAL
Imported on
March 26, 2015
Published on
January 1, 2007
Last modified on
March 31, 2025
Volume 9
vol. 9:2
DOI
10.46298/dmtcs.411
License
https://about.hal.science/hal-authorisation-v1
Indicators
664
Views
624
Downloads

On morphisms preserving infinite Lyndon words

Gwenaël Richomme ORCID (1)
(1) Laboratoire de Recherche en Informatique d'Amiens
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.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • Combinatorics on words
  • morphisms
  • Lyndon words
  • infinite words
  • lexicographic order
Cited by

Source: OpenCitations

  • Quasiperiodic and Lyndon episturmian words

    Theoretical Computer Science

    Authors : Amy Glen, Florence Levé ORCID, Gwénaël Richomme ORCID

    Journal reference : Volume 409, 2008, pp. 578-600

    DOI : 10.1016/j.tcs.2008.09.056
Preview
Loading PDF preview...