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 Zeta/ 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.
机构:
Department of Mathematics, East China University of Science and TechnologyDepartment of Mathematics, East China University of Science and Technology