Lyndon factorization of generalized words of Thue
Discrete mathematics & theoretical computer science, Tome 5 (2002).

Voir la notice de l'article provenant de la source Episciences

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.
@article{DMTCS_2002_5_a2,
     author = {\v{C}ern\'y, Anton},
     title = {Lyndon factorization of generalized words of {Thue}},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {5},
     year = {2002},
     doi = {10.46298/dmtcs.296},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.296/}
}
TY  - JOUR
AU  - Černý, Anton
TI  - Lyndon factorization of generalized words of Thue
JO  - Discrete mathematics & theoretical computer science
PY  - 2002
VL  - 5
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.296/
DO  - 10.46298/dmtcs.296
LA  - en
ID  - DMTCS_2002_5_a2
ER  - 
%0 Journal Article
%A Černý, Anton
%T Lyndon factorization of generalized words of Thue
%J Discrete mathematics & theoretical computer science
%D 2002
%V 5
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.296/
%R 10.46298/dmtcs.296
%G en
%F DMTCS_2002_5_a2
Černý, Anton. Lyndon factorization of generalized words of Thue. Discrete mathematics & theoretical computer science, Tome 5 (2002). doi : 10.46298/dmtcs.296. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.296/

Cité par Sources :