The Complexity of Sequences Generated by the Arc-Fractal System

Hoai Nguyen Huynh, Andri Pradana and Lock Yue Chew

PLOS ONE, 2015, vol. 10, issue 2, 1-21

Abstract: We study properties of the symbolic sequences extracted from the fractals generated by the arc-fractal system introduced earlier by Huynh and Chew. The sequences consist of only a few symbols yet possess several nontrivial properties. First using an operator approach, we show that the sequences are not periodic, even though they are constructed from very simple rules. Second by employing the ϵ-machine approach developed by Crutchfield and Young, we measure the complexity and randomness of the sequences and show that they are indeed complex, i.e. neither periodic nor random, with the value of complexity measure being significant as compared to the known example of logistic map at the edge of chaos. The complexity and randomness of the sequences are then discussed in relation with the properties of associated fractal objects, such as their fractal dimension, symmetry and orientations of the arcs.

Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0117365 (text/html)
https://journals.plos.org/plosone/article/file?id= ... 17365&type=printable (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:plo:pone00:0117365

DOI: 10.1371/journal.pone.0117365

Access Statistics for this article

More articles in PLOS ONE from Public Library of Science
Bibliographic data for series maintained by plosone ().