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 generalized words of Thue

Anton Černý (1)
(1) Department of Mathematics and Computer Science [Kuwait]
Download article
Open on HAL
Imported on
March 26, 2015
Published on
January 1, 2002
Last modified on
March 31, 2025
Volume 5
vol. 5
DOI
10.46298/dmtcs.296
License
https://about.hal.science/hal-authorisation-v1
Indicators
693
Views
562
Downloads

Lyndon factorization of generalized words of Thue

Anton Černý (1)
(1) Department of Mathematics and Computer Science [Kuwait]
Abstract
The i-th symbol of the well-known infinite word of Thue on the alphabet \ 0,1\ can be characterized as the parity of the number of occurrences of the digit 1 in the binary notation of i. Generalized words of Thue are based on counting the parity of occurrences of an arbitrary word w∈\ 0,1\^+-0^* in the binary notation of i. We provide here the standard Lyndon factorization of some subclasses of this class of infinite words.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • Lyndon word
  • Lyndon factorization
  • automatic sequence
Cited by

Source: OpenCitations

  • 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

  • Finding the cyclic covers of a string

    Information Processing Letters

    Authors : Roberto Grossi ORCID, Costas S. Iliopoulos, Jesper Jansson ORCID, Zara Lim ORCID, Wing-Kin Sung ORCID, Wiktor Zuba ORCID

    Journal reference : Volume 191, 2025, pp. 106594

    DOI : 10.1016/j.ipl.2025.106594

  • Finding the Cyclic Covers of a String

    Data Archiving and Networked Services (DANS)

    Authors : Roberto Grossi ORCID, Costas S. Iliopoulos ORCID, Jesper Jansson ORCID, Zara Lim ORCID, Wing-Kin Sung ORCID, Wiktor Zuba ORCID

    Journal reference : Volume , 2023, pp. 139-150

    DOI : 10.1007/978-3-031-27051-2_13

  • Primitive Words and Lyndon Words in Automatic and Linearly Recurrent Sequences

    arXiv (Cornell University)

    Authors : Daniel Goč, Kalle Saari, Jeffrey Shallit ORCID

    Journal reference : Volume , 2013, pp. 311-322

    DOI : 10.1007/978-3-642-37064-9_28
Preview
Loading PDF preview...