Morphisms on infinite alphabets, countable states automata and regular sequences

13 Oct 2016 · Zhang Jie-Meng, Chen Jin, Guo Yingjun, Wen Zhixiong ·

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.