In this chapter we focus on a relatively new and currently quite active branch of automata theory. The study of cellular automata is concerned with the behavior of systems composed of regular arrays of identical interacting components. Theoretical questions of importance in cellular automata research relate to the computational powers of such machines. Thus we might want to know how many components, how many states per component, and what sorts of interconnections among components are required to simulate the behavior of a UTM. Some of the important applications of cellular automata are in the design of parallel computers, the modelling of natural cellular systems, and the solution of systems of equations.
KeywordsCellular Automaton Turing Machine Quiescent State Finite Automaton Cell Space
Unable to display preview. Download preview PDF.