Analytic Proof of the Attractors of a Class of Cellular Automaton
Abstract
In this work we provide analytic results of infinite one-dimensional cellular automaton(CA). By realizing symbolic products, we investigate a subclass of infinite CA and prove analytically that within this subclass the only allowed attractors are homogenous, steady and periodic states for arbitrary initial configuration. Our method also provide exact enumeration of these attractors and it is shown explicitly in a particular model.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.