Computer Science – Formal Languages and Automata Theory
Scientific paper
2011-05-16
Computer Science
Formal Languages and Automata Theory
13 pages
Scientific paper
We give lower bounds on the growth rate of Dejean words, i.e. minimally
repetitive words, over a k-letter alphabet, for k=5, 6, 7, 8, 9, 10. Put
together with the known upper bounds, we estimate these growth rates with the
precision of 0,005. As an consequence, we establish the exponential growth of
the number of Dejean words over a k-letter alphabet, for k=5, 6, 7, 8, 9, 10.
Kolpakov Roman
Rao Michaël
No associations
LandOfFree
On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-77686