English

A characterization of eventually periodicity

Computational Complexity 2014-04-18 v1 Dynamical Systems

Abstract

In this article, we show that the Kamae-Xue complexity function for an infinite sequence classifies eventual periodicity completely. We prove that an infinite binary word x1x2x_1x_2 \cdots is eventually periodic if and only if Σ(x1x2xn)/n3\Sigma(x_1x_2\cdots x_n)/n^3 has a positive limit, where Σ(x1x2xn)\Sigma(x_1x_2\cdots x_n) is the sum of the squares of all the numbers of appearance of finite words in x1x2xnx_1 x_2 \cdots x_n, which was introduced by Kamae-Xue as a criterion of randomness in the sense that x1x2xnx_1x_2\cdots x_n is more random if Σ(x1x2xn)\Sigma(x_1x_2\cdots x_n) is smaller. In fact, it is known that the lower limit of Σ(x1x2xn)/n2\Sigma(x_1x_2\cdots x_n) /n^2 is at least 3/2 for any sequence x1x2x_1x_2 \cdots, while the limit exists as 3/2 almost surely for the (1/2,1/2)(1/2,1/2) product measure. For the other extreme, the upper limit of Σ(x1x2xn)/n3\Sigma(x_1x_2\cdots x_n)/n^3 is bounded by 1/3. There are sequences which are not eventually periodic but the lower limit of Σ(x1x2xn)/n3\Sigma(x_1x_2\cdots x_n)/n^3 is positive, while the limit does not exist.

Cite

@article{arxiv.1404.4416,
  title  = {A characterization of eventually periodicity},
  author = {Teturo Kamae and Dong Han Kim},
  journal= {arXiv preprint arXiv:1404.4416},
  year   = {2014}
}

Comments

11 pages

R2 v1 2026-06-22T03:52:43.337Z