Lower-bounds on the growth of power-free languages over large alphabets

Matthieu Rosenfeld

We study the growth rate of some power-free languages. For any integer $k$ and real $\beta >1$, we let $\alpha (k,\beta )$ be the growth rate of the number of $\beta$-free words of a given length over…