Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10333901 | Theoretical Computer Science | 2011 | 10 Pages |
Abstract
We give lower bounds on the growth rate of Dejean words, i.e. minimally repetitive words, over a k-letter alphabet, for 5â¤kâ¤10. Put together with the known upper bounds, we estimate these growth rates with the precision of 0.005. As a consequence, we establish the exponential growth of the number of Dejean words over a k-letter alphabet, for 5â¤kâ¤10.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Roman Kolpakov, Michaël Rao,