Geodesic
Properties of the extremal infinite smooth words
Discrete mathematics & theoretical computer science, Tome 9 (2007) no. 2.

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

Smooth words are connected to the Kolakoski sequence. We construct the maximal and the minimal in nite smooth words, with respect to the lexicographical order. The naive algorithm generating them is improved by using a reduction of the De Bruijn graph of their factors. We also study their Lyndon factorizations. Finally, we show that the minimal smooth word over the alphabet f1; 3g belongs to the orbit of the Fibonacci word. 
@article{DMTCS_2007_9_2_a14,
     author = {Brlek, Sre\v{c}ko and Melan\c{c}on, Guy and Paquin, Genevi\`eve},
     title = {Properties of the extremal infinite smooth words},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {9},
     number = {2},
     year = {2007},
     doi = {10.46298/dmtcs.412},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.412/}
}
TY  - JOUR
AU  - Brlek, Srečko
AU  - Melançon, Guy
AU  - Paquin, Geneviève
TI  - Properties of the extremal infinite smooth words
JO  - Discrete mathematics & theoretical computer science
PY  - 2007
VL  - 9
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.412/
DO  - 10.46298/dmtcs.412
LA  - en
ID  - DMTCS_2007_9_2_a14
ER  - 
%0 Journal Article
%A Brlek, Srečko
%A Melançon, Guy
%A Paquin, Geneviève
%T Properties of the extremal infinite smooth words
%J Discrete mathematics & theoretical computer science
%D 2007
%V 9
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.412/
%R 10.46298/dmtcs.412
%G en
%F DMTCS_2007_9_2_a14
Brlek, Srečko; Melançon, Guy; Paquin, Geneviève. Properties of the extremal infinite smooth words. Discrete mathematics & theoretical computer science, Tome 9 (2007) no. 2. doi : 10.46298/dmtcs.412. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.412/

Cité par Sources :