11 citations · 17 across the 6 of their papers we have counts for
Showing 2016Show 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…
math.CO2016★ 11 cited
On the abelian complexity of the Rudin-Shapiro sequence
Xiaotao Lü, Jin Chen, Zhixiong Wen +1
In this paper, we study the abelian complexity of the Rudin-Shapiro sequence and a related sequence. We show that these two sequences share the same complexity function whic…