On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters

2011/05/16 by Kolpakov, Roman, Rao, Michael · 1 citation
#FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL)

paper · doi:10.48550/arxiv.1105.3116

Abstract

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.

Cited by

• Maximizing entropy for power-free languages

Related

• The Number of Threshold Words on n Letters Grows Exponentially for Every n≥ 27
• Lower-bounds on the growth of power-free languages over large alphabets
• Growth rate of binary words avoiding xxx^R
• A Generalization of Repetition Threshold
• Counting words without non-decreasing subwords of fixed length