We consider asynchronous one-dimensional cellular automata (CA). It is shown that there is one with von Neumann neighborhood of radius 1 which can simulate each asynchronous one-dimensional cellular automaton. An analogous construction is described for α-asynchronous CA (where each cell independently enters a new state with probability a. We also point out some generalizations for other updating schemes.
展开▼
