Geodesic
Efficient lower bounds on the number of repetition-free words
Journal of integer sequences, Tome 10 (2007) no. 3.

Voir la notice de l'article provenant de la source Electronic Library of Mathematics

Summary: We propose a new effective method for obtaining lower bounds on the number of repetition-free words over a finite alphabet.
Classification : 05A20, 68R15
Keywords: combinatorics on words, repetition-free words, growth rate 
@article{JIS_2007__10_3_a7,
     author = {Kolpakov, Roman},
     title = {Efficient lower bounds on the number of repetition-free words},
     journal = {Journal of integer sequences},
     publisher = {mathdoc},
     volume = {10},
     number = {3},
     year = {2007},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/JIS_2007__10_3_a7/}
}
TY  - JOUR
AU  - Kolpakov, Roman
TI  - Efficient lower bounds on the number of repetition-free words
JO  - Journal of integer sequences
PY  - 2007
VL  - 10
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/JIS_2007__10_3_a7/
LA  - en
ID  - JIS_2007__10_3_a7
ER  - 
%0 Journal Article
%A Kolpakov, Roman
%T Efficient lower bounds on the number of repetition-free words
%J Journal of integer sequences
%D 2007
%V 10
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/JIS_2007__10_3_a7/
%G en
%F JIS_2007__10_3_a7
Kolpakov, Roman. Efficient lower bounds on the number of repetition-free words. Journal of integer sequences, Tome 10 (2007) no. 3. http://geodesic.mathdoc.fr/item/JIS_2007__10_3_a7/