Classsification of Cellular Automata

@inproceedings{Sutner2007ClasssificationOC,
  title={Classsification of Cellular Automata},
  author={Klaus Sutner},
  year={2007}
}
Glossary Cellular Automaton For our purposes, a (one-dimensional) cellular automaton (CA) is given by a local map ρ : Σ → Σ where Σ is the underlying alphabet of the automaton and w is its width. As a data structure, suitable as input to a decision algorithm, a CA can thus be specified by a simple lookup table. We abuse notation and write ρ(x) for the result of applying the global map of the CA to configuration x ∈ ΣZ. Wolfram Classes Wolfram proposed a heuristic classification of cellular… CONTINUE READING