Morphisms on infinite alphabets, countable states automata and regular sequences

Jie-Meng Zhang, Jin Chen, Ying-Jun Guo and Zhi-Xiong Wen

Chaos, Solitons & Fractals, 2017, vol. 99, issue C, 263-269

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.

Keywords: Automatic sequence; Regular sequence; Morphism; Countable states automaton; Linear recurrence (search for similar items in EconPapers)
Date: 2017
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0960077917301534
Full text for ScienceDirect subscribers only

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:eee:chsofr:v:99:y:2017:i:c:p:263-269

DOI: 10.1016/j.chaos.2017.04.018

Access Statistics for this article

Chaos, Solitons & Fractals is currently edited by Stefano Boccaletti and Stelios Bekiros

More articles in Chaos, Solitons & Fractals from Elsevier
Bibliographic data for series maintained by Thayer, Thomas R. ().