Lyndon factorization of generalized words of Thue

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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Discrete mathematics and theoretical computer science 2002-01, Vol.5, p.17-46
1. Verfasser:	Černý, Anton
Format:	Artikel
Sprache:	eng
Schlagworte:	[info.info-dm] computer science [cs]/discrete mathematics [cs.dm] automatic sequence Computer Science Discrete Mathematics lyndon factorization lyndon word
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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.
ISSN:	1365-8050 1462-7264 1365-8050
DOI:	10.46298/dmtcs.296