论文标题
在模量循环单词上的细胞自动机研究中
On the study of cellular automata on modulo-recurrent words
论文作者
论文摘要
在本文中，我们研究了一类称为稳定细胞自动机（SCA）的细胞自动机（CA），这些自动机（SCA）通过反射，模量循环和丰富度来保持稳定性。将这些自动机应用于Sturmian单词后，我们确定了它们的一些组合特性。接下来，我们计算这些单词的经典和回文复杂性函数。最后，我们证明这些词是$ 2 $平衡的，并确定了其Abelian复杂性功能。
In this paper, we study a class of cellular automata (CA) called stable cellular automata (SCA) that preserve stability by reflection, modulo-recurrent, and richness. After applying these automata to Sturmian words, we determine some of their combinatorial properties. Next, we calculate the classical and palindromic complexity functions of these words. Finally, we demonstrate that these words are $2$-balanced and establish their abelian complexity function.
