On cogrowth function of uniformly recurrent sequences

Abstract

For a sequence $W$ we count the number $O_W(n)$ of minimal forbidden words no longer then $n$ and prove that $$\overline{\underset{n\to \infty }{\lim }}\frac{O_W(n)}{{\log }_{3}n}\ge 1.$$

arXiv commentan example added, 6 pages

References in corpus (1)

• The maximal length of the period of a periodic word defined by restrictions