Morphisms on infinite alphabets, countable states automata and regular sequences
Formal Languages and Automata Theory
2017-05-24 v1
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.
Cite
@article{arxiv.1610.03971,
title = {Morphisms on infinite alphabets, countable states automata and regular sequences},
author = {Jie-Meng Zhang and Jin Chen and Yingjun Guo and Zhixiong Wen},
journal= {arXiv preprint arXiv:1610.03971},
year = {2017}
}
Comments
10 pages