Fundamentalʹnaâ i prikladnaâ matematika, Tome 1 (1995) no. 1, pp. 71-79
Citer cet article
A. Ya. Belov; G. V. Kondakov. Inverse problems of symbolic dimamics. Fundamentalʹnaâ i prikladnaâ matematika, Tome 1 (1995) no. 1, pp. 71-79. http://geodesic.mathdoc.fr/item/FPM_1995_1_1_a2/
@article{FPM_1995_1_1_a2,
author = {A. Ya. Belov and G. V. Kondakov},
title = {Inverse problems of symbolic dimamics},
journal = {Fundamentalʹna\^a i prikladna\^a matematika},
pages = {71--79},
year = {1995},
volume = {1},
number = {1},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/FPM_1995_1_1_a2/}
}
TY - JOUR
AU - A. Ya. Belov
AU - G. V. Kondakov
TI - Inverse problems of symbolic dimamics
JO - Fundamentalʹnaâ i prikladnaâ matematika
PY - 1995
SP - 71
EP - 79
VL - 1
IS - 1
UR - http://geodesic.mathdoc.fr/item/FPM_1995_1_1_a2/
LA - ru
ID - FPM_1995_1_1_a2
ER -
%0 Journal Article
%A A. Ya. Belov
%A G. V. Kondakov
%T Inverse problems of symbolic dimamics
%J Fundamentalʹnaâ i prikladnaâ matematika
%D 1995
%P 71-79
%V 1
%N 1
%U http://geodesic.mathdoc.fr/item/FPM_1995_1_1_a2/
%G ru
%F FPM_1995_1_1_a2
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 $deg(P)=n$, then $T(k)=Q(k)$ for all sufficiently large $k$.