: Uses Lyapunov stability to group automata by their sensitivity to initial conditions.
: Using Bernoulli measures to describe the "size" of the set of states attracted to a specific behavior. Cellular Automata: Analysis and Applications
: Examining behavior within Cantor, Besicovitch, and Weyl topologies. : Uses Lyapunov stability to group automata by
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
: Investigating whether certain properties of a CA can be determined through algorithmic procedures. Applications Across Disciplines
While grounded in mathematics, the principles in Cellular Automata: Analysis and Applications extend to various fields where local interactions drive global patterns:
: Categorizes CAs through the lens of formal languages and grammars.