Cited 4 time in
A characterization of eventual periodicity
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Kamae, Teturo | - |
| dc.contributor.author | Kim, Dong Han | - |
| dc.date.accessioned | 2024-08-08T01:02:26Z | - |
| dc.date.available | 2024-08-08T01:02:26Z | - |
| dc.date.issued | 2015-05-24 | - |
| dc.identifier.issn | 0304-3975 | - |
| dc.identifier.issn | 1879-2294 | - |
| dc.identifier.uri | https://scholarworks.dongguk.edu/handle/sw.dongguk/15072 | - |
| dc.description.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. | - |
| dc.format.extent | 8 | - |
| dc.language | 영어 | - |
| dc.language.iso | ENG | - |
| dc.publisher | ELSEVIER SCIENCE BV | - |
| dc.title | A characterization of eventual periodicity | - |
| dc.type | Article | - |
| dc.publisher.location | 네델란드 | - |
| dc.identifier.doi | 10.1016/j.tcs.2015.02.039 | - |
| dc.identifier.scopusid | 2-s2.0-84951854022 | - |
| dc.identifier.wosid | 000353608700001 | - |
| dc.identifier.bibliographicCitation | THEORETICAL COMPUTER SCIENCE, v.581, pp 1 - 8 | - |
| dc.citation.title | THEORETICAL COMPUTER SCIENCE | - |
| dc.citation.volume | 581 | - |
| dc.citation.startPage | 1 | - |
| dc.citation.endPage | 8 | - |
| dc.type.docType | Article | - |
| dc.description.isOpenAccess | Y | - |
| dc.description.journalRegisteredClass | sci | - |
| dc.description.journalRegisteredClass | scie | - |
| dc.description.journalRegisteredClass | scopus | - |
| dc.relation.journalResearchArea | Computer Science | - |
| dc.relation.journalWebOfScienceCategory | Computer Science, Theory & Methods | - |
| dc.subject.keywordAuthor | Kamae-Xue complexity | - |
| dc.subject.keywordAuthor | Eventually periodic sequences | - |
| dc.subject.keywordAuthor | Low complexity sequences | - |
| dc.subject.keywordAuthor | Combinatorics on words | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
30, Pildong-ro 1-gil, Jung-gu, Seoul, 04620, Republic of Korea+82-2-2260-3114
Copyright(c) 2023 DONGGUK UNIVERSITY. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.
