On the dynamical behaviour of cellular automata

In this paper, we show that the mathematical classification of one-dimensional cellular automata given by Dubois–Violette and Rouet [1987] does not truly represent the different behaviors possible. In fact we show that many rules of their type O have totally different behavior. A better classification is based on Smale's basic sets and nonwandering points. Read More: http://www.worldscientific.com/doi/abs/10.1142/S021812740902355X