|
Articles Cellular Automata Tables of Cellular Automaton Properties (1986)
Tables of Cellular Automaton Properties (1986) |
|
This table shows patterns produced by second-order generalizations of the 
, 
cellular automata considered above. The rules are of the form
where 
is a standard , function, as listed in table 1. Such rules determine the configuration at time 
in terms of the configurations both at time 
and time 
. The rules have the special feature that they are reversible: given configurations at times and , the configuration at time can be deduced uniquely according to the rule
The first set of patterns were generated with disordered initial configurations at times 
and 
. In the second set of patterns, the configurations at time and were both taken to be 
.
The forms of behaviour produced by these reversible rules are qualitatively similar to those from standard , cellular automata, shown in tables 2 and 5. Evolution to a homogeneous, fixed, pattern is however impossible for reversible systems.
