## Fractal and recurrent behavior of cellular automata.(English)Zbl 0732.68079

Summary: Regular evolution of totalistic linear CA is investigated. In particular, it is shown that additive CA will always produce a highly regular behavior on an arbitrary finite configuration as the initial seed. Totalistic CA with binary function code of the form $$0^ n1^{2m}0^ n$$ are also studied. The results are extended to trellis automata.

### MSC:

 68Q80 Cellular automata (computational aspects)

### Keywords:

cellular automata