A guided tour of asynchronous cellular automata
From MaRDI portal
Publication:2851298
DOI10.1007/978-3-642-40867-0_2zbMATH Open1336.68168OpenAlexW2176256423MaRDI QIDQ2851298FDOQ2851298
Publication date: 10 October 2013
Published in: Cellular Automata and Discrete Complex Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-40867-0_2
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Cellular automata (computational aspects) (68Q80)
Cited In (11)
- Characterization of random fluctuation-based computation in cellular automata
- Supercritical probabilistic cellular automata: how effective is the synchronous updating?
- Stochastic Stability in Schelling’s Segregation Model with Markovian Asynchronous Update
- ASYNCHRONOUS AUTOMATA NETWORKS CAN EMULATE ANY SYNCHRONOUS AUTOMATA NETWORK
- Building squares with optimal state complexity in restricted active self-assembly
- Land use and land cover change simulation enhanced by asynchronous communicating cellular automata
- Realization problems for nonuniform cellular automata
- Overview: PCA Models and Issues
- Turing-completeness of asynchronous non-camouflage cellular automata
- Asynchronous, finite dynamical systems
- Fixing monotone Boolean networks asynchronously
Recommendations
This page was built for publication: A guided tour of asynchronous cellular automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2851298)
