Igor Melnikov

On cogrowth function of uniformly recurrent sequences

For a sequence $W$ we count the number $O_W(n)$ of minimal forbidden words no longer then $n$ and prove that $$\overline{\lim_{n \to \infty}} \frac{O_W(n)}{\log_3n} \geq 1.$$