On cogrowth function of uniformly recurrent sequences
Igor Melnikov, Ivan Mitrofanov·2020-01-08·via math.CO updates on arXiv.org
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.$$