Abstract
In this paper we introduce a classification of elementary cellular automata based solely on numerical properties of the lengths of their limit cycles on finite lattices Z/k. The classification has a formal definition, and it could in principle be proved whether a given cellular automaton belongs to a given class. It will remain open if this is generally possible, that is, if the question is decidable.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Classification of cellular automata based on the Hamming distance;Chaos: An Interdisciplinary Journal of Nonlinear Science;2024-08-01