Some results on cellular automata (Q1305149)

Summary: We want to discuss some properties of one-dimensional, radius 1, CUCAs. In particular, on one hand we want to keep small the number of states; on the other hand we are interested into automata, possibly requiring a high number of states, whose transition law is ``as simple as possible''; e.g. totalistic automata. More generally, we deal with the problem of simulating a generic cellular automaton through an automaton having a ``simpler'' transition law.