Efficient Lower Bounds on the Number of Repetition-free Words
Lomonosov Moscow State University
We propose a new effective method for obtaining lower bounds on the
number of repetition-free words over a finite alphabet.
Full version: pdf,
(Concerned with sequence
Received January 9 2007;
revised version received March 8 2007.
Published in Journal of Integer Sequences March 20 2007.
Journal of Integer Sequences home page