Morphisms on infinite alphabets, countable states automata and regular sequences
Morphisms on infinite alphabets, countable states automata and regular sequences
复制标题
无限字母表、可数状态自动机和正则序列上的态射
DOI：
10.1016/j.chaos.2017.04.018
复制
发表时间：
2017
影响因子：
7.8
通讯作者：
Wen Zhi-Xiong
中科院分区：
文献类型：
--
作者：
Zhang Jie-Meng;Chen Jin;Guo Ying-Jun;Wen Zhi-Xiong
本文证明了一类正则序列可以看作是一致态射的不动点在可数字母表上的投影，也可以由可数状态自动机生成。此外，我们还证明了某些正则序列的正则性在某些编码下是不变的。
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.