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. Lyndon factorization ...
Article

Lyndon factorization of the Thue-Morse word and its relatives

Augustin Ido (1), Guy Melançon ORCID (1)
(1) Laboratoire Bordelais de Recherche en Informatique
Download article
Open on HAL
Imported on
March 26, 2015
Published on
January 1, 1997
Last modified on
March 31, 2025
Volume 1
vol. 1
DOI
10.46298/dmtcs.233
License
https://about.hal.science/hal-authorisation-v1
Indicators
760
Views
1186
Downloads

Lyndon factorization of the Thue-Morse word and its relatives

Augustin Ido (1), Guy Melançon ORCID (1)
(1) Laboratoire Bordelais de Recherche en Informatique
Abstract
We compute the Lyndon factorization of the Thue-Morse word. We also compute the Lyndon factorization of two related sequences involving morphisms that give rise to new presentations of these sequences.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • morphisms
  • Lyndon factorization
  • Thue-Morse word
Cited by

Source: OpenCitations

  • Nyldon Factorization of Thue-Morse Words and Fibonacci Words

    Lecture notes in computer science

    Authors : Kaisei Kishi, Kazuki Kai ORCID, Yuto Nakashima ORCID, Shunsuke Inenaga ORCID, Hideo Bannai ORCID

    Journal reference : Volume , 2025, pp. 188-201

    DOI : 10.1007/978-3-032-05228-5_16

  • Lyndon factorization of the Prouhet words

    Theoretical Computer Science

    Authors : Patrice Séébold

    Journal reference : Volume 307, 2003, pp. 179-197

    DOI : 10.1016/s0304-3975(03)00100-2

  • Lyndon factorization of generalized words of Thue

    Discrete Mathematics & Theoretical Computer Science

    Authors : Anton Černý

    Journal reference : Volume Vol. 5, 2002, pp.

    DOI : 10.46298/dmtcs.296

  • Conjugacy of morphisms and Lyndon decomposition of standard Sturmian words

    Theoretical Computer Science

    Authors : G. Richomme

    Journal reference : Volume 380, 2007, pp. 393-400

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