A tutorial on elementary cellular automata with fully asynchronous updating. General properties and convergence dynamics
From MaRDI portal
Publication:6151165
DOI10.1007/S11047-020-09782-7zbMATH Open1530.37029OpenAlexW2997933817WikidataQ126308494 ScholiaQ126308494MaRDI QIDQ6151165FDOQ6151165
Authors: Nazim Fatès 
Publication date: 9 February 2024
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11047-020-09782-7
Recommendations
- Convergence of asynchronous cellular automata: does size matter?
- Examples of Fast and Slow Convergence of 2D Asynchronous Cellular Systems
- Fully asynchronous behavior of double-quiescent elementary cellular automata
- Mathematical Foundations of Computer Science 2005
- Examples of fast and slow convergence of 2D asynchronous cellular systems
Cites Work
- Theory of cellular automata: a survey
- Asynchronism induces second-order phase transitions in elementary cellular automata
- Progresses in the analysis of stochastic 2D cellular automata: a study of asynchronous 2D minority
- A perfect solution to the parity problem with elementary cellular automaton 150 under asynchronous update
- Fully asynchronous behavior of double-quiescent elementary cellular automata
- Asynchronous Behavior of Double-Quiescent Elementary Cellular Automata
- Computing issues of asynchronous CA
- Cellular automaton modeling of biological pattern formation. Characterization, applications, and analysis. With a foreword by Philip K. Maini
- A full computation-relevant topological dynamics classification of elementary cellular automata
- Guided tour of asynchronous cellular automata
- Stochastic minority on graphs
- Effect of asynchronous updating on the stability of cellular automata
- Reversibility of elementary cellular automata under fully asynchronous update
- Basic ideas to approach metastability in probabilistic cellular automata
- Developments in language theory. 17th international conference, DLT 2013, Marne-la-Vallée, France, June 18--21, 2013. Proceedings
- Convergence of asynchronous cellular automata: does size matter?
- Convergence time of probabilistic cellular automata on the torus
- A note on the classification of the most simple asynchronous cellular automata
- Examples of fast and slow convergence of 2D asynchronous cellular systems
- Cellular automata: descriptional complexity and decidability
- Epidemic automaton and the Eden model: various aspects of robustness
Cited In (4)
This page was built for publication: A tutorial on elementary cellular automata with fully asynchronous updating. General properties and convergence dynamics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6151165)
