title: The complexity of sequences generated by the arc-fractal system.
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.
authors.affiliation: Complexity Institute, Nanyang Technological University, Singapore, Singapore.
authors.forename: Hoai Nguyen
authors.initials: HN
authors.lastname: Huynh
authors.affiliation: Divison of Physics and Applied Physics, School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore, Singapore.
authors.forename: Andri
authors.initials: A
authors.lastname: Pradana
authors.affiliation: Complexity Institute, Nanyang Technological University, Singapore, Singapore; Divison of Physics and Applied Physics, School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore, Singapore.
authors.forename: Lock Yue
authors.initials: LY
authors.lastname: Chew
mesh_terms: D000465:Algorithms; D017709:Fractals; D008962:Models, Theoretical