Abstract
We consider asynchronous one-dimensional cellular automa- ta (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 α. We also point out some generalizations for other updating schemes. © 2012 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Worsch, T. (2012). (Intrinsically?) Universal asynchronous CA. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7495 LNCS, pp. 689–698). Springer Verlag. https://doi.org/10.1007/978-3-642-33350-7_71
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
