Morphisms on infinite alphabets, countable states automata and regular sequences
arXiv:1610.03971 · doi:10.1016/j.chaos.2017.04.018
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.
10 pages