Skip to Main content Skip to Navigation
Journal articles

Lyndon factorization of generalized words of Thue

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.
Document type :
Journal articles
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download

https://hal.inria.fr/hal-00958970
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Thursday, March 13, 2014 - 4:54:27 PM
Last modification on : Wednesday, November 29, 2017 - 10:26:22 AM
Long-term archiving on: : Friday, June 13, 2014 - 12:06:23 PM

File

dm050102.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00958970, version 1

Collections

Citation

Anton Černý. Lyndon factorization of generalized words of Thue. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2002, 5, pp.17-46. ⟨hal-00958970⟩

Share

Metrics

Record views

106

Files downloads

715