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.Expand

We study a binary-cell-state eight-cell neighborhood two-dimensional cellular automaton model of a quasi-chemical system with a substrate and a reagent.Expand

We study Life-like cellular automaton rule B2/S2345. This automaton exhibits a chaotic behaviour yet capable for purposeful computation. The automaton implements Boolean gates via patterns which… Expand

We study one-dimensional (1D) binary state ternary neighborhood cellular automata exhibiting a sophisticated space–time dynamics of traveling localized patterns, and deal with cell state transition Rule 54, mainly due to its ability to generate rich varieties of periodic structures.Expand

This paper examines the claim that cellular automata belonging to Class III (in Wolfram’s classification) are capable of (Turing universal) computation.Expand

We propose a representation for coding initial conditions by means of a finite subset of regular expressions specifying a set of phases for each glider in Rule 110.Expand

The paper builds a hierarchy of generative diversity of one‐dimensional cellular automata with binary cell‐states and ternary neighborhoods, discusses necessary conditions for a cell‐state transition rule to be on top of the hierarchy, and studies stability to initial conditions.Expand

The dynamics of rule 54 one-dimensional two-state cellular automaton are a discrete analog of space-time dynamics of excitations in nonlinear active medium with mutual inhibition.Expand