A Note on Elementary Cellular Automata Classification

Abstract

We overview and compare classifications of elementary cellular automata, including Wolfram's, Wuensche's, Li and Packard, communication complexity, power spectral, topological, surface, compression, lattices, and morphological diversity classifications. This paper summarises several classifications of elementary cellular automata (ECA) and compares them with a newly proposed one, that induced by endowing rules with memory.

26 pages, 4 figures, accepted by publish in Journal of Cellular Automata

Cited by in corpus (6)

• Designing Complex Dynamics in Cellular Automata with Memory
• Simple networks on complex cellular automata: From de Bruijn diagrams to jump-graphs
• Elementary, Finite and Linear vN-Regular Cellular Automata
• Quantum-inspired identification of complex cellular automata
• Definition and Identification of Information Storage and Processing Capabilities as Possible Markers for Turing-universality in Cellular Automata
• Investigation of Rule 73 as Case Study of Class 4 Long-Distance Cellular Automata