Belov, A. Ya.; Kondakov, G. V. Inverse problems of symbolic dynamics. (Russian. English summary) Zbl 0868.58023 Fundam. Prikl. Mat. 1, No. 1, 71-79 (1995). Summary: Let \(P(n)\) be a polynomial with irrational greatest coefficient. Let also a superword \(W\) \((W=(w_n)\), \(n\in \mathbb{N})\) be the sequence of first binary digits of \(\{P(n)\}\), i.e., \(w_n=[2\{P(n)\}]\), and \(T(k)\) be the number of different subwords of \(W\) whose length is equal to \(k\). The main result of the paper is the following:Theorem 1.1. For any \(n\) there exists a polynomial \(Q(k)\) such that if \(\text{deg}(P)=n\), then \(T(k)=Q(k)\) for all sufficiently large \(k\). Cited in 1 ReviewCited in 2 Documents MSC: 37E99 Low-dimensional dynamical systems Keywords:inverse problems; symbolic dynamics PDFBibTeX XMLCite \textit{A. Ya. Belov} and \textit{G. V. Kondakov}, Fundam. Prikl. Mat. 1, No. 1, 71--79 (1995; Zbl 0868.58023)