Cellular Automata with Infinite Number of Subshift Attractors

Abstract

We argue that the complexity of a cellular automaton is reflected in the complexity of the lattice of its subshift attractors We construct cellular automata with infinite lattice of subshift attractors of arbitrarily high complexity

Keywords

• infinite number
• subshift attractors