A comparison of finite and cellular automata

Abstract

We conceive finite and cellular automata as dynamical systems on zero-dimensional spaces and show that they are incomparable in the sense of factorization. Next we study the complexity of languages generated by zero-dimensional systems on clopen partitions of the state space. While finite automata generate only regular languages, cellular automata generate non-deterministic polynomial languages which may be non-regular.