Complex Systems

Cellular Automata with an Infinite Number of Subshift Attractors Download PDF

Petr Kůrka
Center for Theoretical Study,
Academy of Sciences and Charles University,
Jilská 1, CZ-11000 Praha 1, Czechia.


We argue that the complexity of a cellular automaton is reflected in the complexity of the lattice of its subshift attractors (i.e., of those attractors which are subshifts). We construct cellular automata with an infinite lattice of subshift attractors of arbitrarily high complexity.