Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
5499680 | Chaos, Solitons & Fractals | 2017 | 7 Pages |
Abstract
In this paper, we prove that a class of regular sequences can be viewed as projections of fixed points of uniform morphisms on a countable alphabet, and also can be generated by countable states automata. Moreover, we prove that the regularity of some regular sequences is invariant under some codings.
Related Topics
Physical Sciences and Engineering
Physics and Astronomy
Statistical and Nonlinear Physics
Authors
Jie-Meng Zhang, Jin Chen, Ying-Jun Guo, Zhi-Xiong Wen,