Papers
Topics
Authors
Recent
Search
2000 character limit reached

A characterization of eventually periodicity

Published 17 Apr 2014 in cs.CC and math.DS | (1404.4416v1)

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 $x_1x_2 \cdots $ is eventually periodic if and only if $\Sigma(x_1x_2\cdots x_n)/n3$ has a positive limit, where $\Sigma(x_1x_2\cdots x_n)$ is the sum of the squares of all the numbers of appearance of finite words in $x_1 x_2 \cdots x_n$, which was introduced by Kamae-Xue as a criterion of randomness in the sense that $x_1x_2\cdots x_n$ is more random if $\Sigma(x_1x_2\cdots x_n)$ is smaller. In fact, it is known that the lower limit of $\Sigma(x_1x_2\cdots x_n) /n2 $ is at least 3/2 for any sequence $x_1x_2 \cdots$, while the limit exists as 3/2 almost surely for the $(1/2,1/2)$ product measure. For the other extreme, the upper limit of $\Sigma(x_1x_2\cdots x_n)/n3$ is bounded by 1/3. There are sequences which are not eventually periodic but the lower limit of $\Sigma(x_1x_2\cdots x_n)/n3$ is positive, while the limit does not exist.

Authors (2)
Citations (3)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.