A characterization of eventual periodicityopen access
- Authors
- Kamae, Teturo; Kim, Dong Han
- Issue Date
- 24-May-2015
- Publisher
- ELSEVIER SCIENCE BV
- Keywords
- Kamae-Xue complexity; Eventually periodic sequences; Low complexity sequences; Combinatorics on words
- Citation
- THEORETICAL COMPUTER SCIENCE, v.581, pp 1 - 8
- Pages
- 8
- Indexed
- SCI
SCIE
SCOPUS
- Journal Title
- THEORETICAL COMPUTER SCIENCE
- Volume
- 581
- Start Page
- 1
- End Page
- 8
- URI
- https://scholarworks.dongguk.edu/handle/sw.dongguk/15072
- DOI
- 10.1016/j.tcs.2015.02.039
- ISSN
- 0304-3975
1879-2294
- 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(1)x(2)... is eventually periodic if and only if Sigma(x(1)x(2)...x(n))/n(3) has a positive limit, where Sigma(x(1)x(2)...x(n)) is the sum of the squares of all the numbers of occurrences of finite words in x(1)x(2)...x(n), which was introduced by Kamae-Xue as a criterion of randomness in the sense that x(1)x(2)...x(n) is more random if Sigma(x(1)x(2)...x(n)) is smaller. In fact, it is known that the lower limit of Sigma(x(1)x(2)...x(n))/n(2) is at least 3/2 for any sequence x(1)x(2)..., 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(1)x(2)...x(n))/n(3) is bounded by 1/3. There are sequences which are not eventually periodic but the lower limit of Sigma(x(1)x(2)...x(n))/n(3) is positive, while the limit does not exist. (C) 2015 Elsevier B.V. All rights reserved.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Education > Department of Mathematics Education > 1. Journal Articles

Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.