7 citations · 8 across the 5 of their papers we have counts for
Showing cs.FLShow all
2 papers · 1 filter
cs.FL2016
Morphisms on infinite alphabets, countable states automata and regular sequences
Jie-Meng Zhang, Jin Chen, Yingjun Guo +1
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 co…
cs.FL2015★ 1 cited
On the regularity of
Jiemeng Zhang, Yingjun Guo, Zhixiong Wen
Let be real numbers and be an integer. Allouche and Shallit showed that the sequence is -regular if and only if is rational.…