On Cellular Automata

Abstract: Cellular automata are a fundamental computational model with applications in mathematics, computer science, and physics. In this work, we explore the study of cellular automata to cases where the universe is a group, introducing the concept of ( \phi )-cellular automata. We establish new theoretical results, including a generalized Uniform Curtis-Hedlund Theorem and linear ( \phi )-cellular automata. Additionally, we define the covering map for ( \phi )-cellular automata and investigate its properties. Specifically, we derive results for quotient covers when the universe of the automaton is a circulant graph. This work contributes to the algebraic and topological understanding of cellular automata, paving the way for future exploration of different types of covers and their applications to broader classes of graphs and dynamical systems.