: Uses Lyapunov stability to group automata by their sensitivity to initial conditions.
The book defines cellular automata (CAs) as deterministic systems with high degrees of symmetry, typically operating on regular grids or Cayley graphs . It explores several critical classification schemes: Cellular Automata: Analysis and Applications
: Based on topological concepts and attractor sets. : Uses Lyapunov stability to group automata by
: Employed to decompose "attractors"—the set of asymptotic states—into smaller, structured parts. Mathematical Analysis Techniques Cellular Automata: Analysis and Applications
: Categorizes CAs through the lens of formal languages and grammars.