Reversible space-time simulation of cellular automata
Theoretical Computer Science
Examples of Fast and Slow Convergence of 2D Asynchronous Cellular Systems
ACRI '08 Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry
Progresses in the analysis of stochastic 2D cellular automata: A study of asynchronous 2D minority
Theoretical Computer Science
What do we mean by asynchronous CA? a reflection on types and effects of asynchronicity
ACRI'10 Proceedings of the 9th international conference on Cellular automata for research and industry
Bulking II: Classifications of cellular automata
Theoretical Computer Science
Probing robustness of cellular automata through variations of asynchronous updating
Natural Computing: an international journal
| Hi-index | 0.00 |
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. Analogous constructions are described for 驴-asynchronous CA (where each cell independently enters a new state with probability 驴, and for "neighborhood independent" asynchronous CA (where never two cells are updated simultaneously if one is in the neighborhood of the other). This also gives rise to a construction for so-called fully asynchronous CA (where in each step exactly one cell is updated).