A characterization of infinite smooth Lyndon words
Discrete mathematics & theoretical computer science, Tome 12 (2010) no. 5 Cet article a éte moissonné depuis la source Episciences

Voir la notice de l'article

Combinatorics
@article{DMTCS_2010_12_5_a1,
     author = {Paquin, Genevi\`eve},
     title = {A characterization of infinite smooth {Lyndon} words},
     journal = {Discrete mathematics & theoretical computer science},
     year = {2010},
     volume = {12},
     number = {5},
     doi = {10.46298/dmtcs.485},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.485/}
}
TY  - JOUR
AU  - Paquin, Geneviève
TI  - A characterization of infinite smooth Lyndon words
JO  - Discrete mathematics & theoretical computer science
PY  - 2010
VL  - 12
IS  - 5
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.485/
DO  - 10.46298/dmtcs.485
LA  - en
ID  - DMTCS_2010_12_5_a1
ER  - 
%0 Journal Article
%A Paquin, Geneviève
%T A characterization of infinite smooth Lyndon words
%J Discrete mathematics & theoretical computer science
%D 2010
%V 12
%N 5
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.485/
%R 10.46298/dmtcs.485
%G en
%F DMTCS_2010_12_5_a1
Paquin, Geneviève. A characterization of infinite smooth Lyndon words. Discrete mathematics & theoretical computer science, Tome 12 (2010) no. 5. doi: 10.46298/dmtcs.485

Cité par Sources :