On cogrowth function of uniformly recurrent sequences

MaRDI QIDQ6332481zbMATH OpenFDO

Authors Igor Melnikov, Ivan Mitrofanov

Publication date 7 January 2020

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

This page was built for publication: On cogrowth function of uniformly recurrent sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6332481)