Fully asynchronous behavior of double-quiescent elementary cellular automata

DOI10.1016/j.tcs.2006.05.036zbMath1101.68058OpenAlexW3021455299MaRDI QIDQ2508958

Nicolas Schabanel, Michel Morvan, Nazim Fatès, Éric Thierry

Publication date: 20 October 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://hal-lara.archives-ouvertes.fr/hal-02101819/file/RR2005-04.pdf

zbMATH Keywords

stochastic processasynchronous cellular automataconvergence predictions

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items (26)

\(m\)-asynchronous cellular automata: from fairness to quasi-fairness ⋮ Characterization of random fluctuation-based computation in cellular automata ⋮ Computation of functions on \(n\) bits by asynchronous clocking of cellular automata ⋮ Asynchronous cellular automata and dynamical properties ⋮ Lost in self-stabilization: a local process that aligns connected cells ⋮ Epidemic Automaton and the Eden Model: Various Aspects of Robustness ⋮ Convergence Time of Probabilistic Cellular Automata on the Torus ⋮ Stochastic cellular automata solutions to the density classification problem. When randomness helps computing ⋮ Convergence time and phase transition in a non-monotonic family of probabilistic cellular automata ⋮ Lost in Self-Stabilization ⋮ Affine continuous cellular automata solving the fixed-length density classification problem ⋮ Communication complexity meets cellular automata: necessary conditions for intrinsic universality ⋮ A tutorial on elementary cellular automata with fully asynchronous updating. General properties and convergence dynamics ⋮ A survey of cellular automata: types, dynamics, non-uniformity and applications ⋮ Cellular Automata Pseudo-Random Number Generators and Their Resistance to Asynchrony ⋮ CLOUDS IN THE BASINS OF FULLY ASYNCHRONOUS CELLULAR AUTOMATA ⋮ Fixing monotone Boolean networks asynchronously ⋮ Unnamed Item ⋮ The firing squad synchronization problem on CA with multiple updating cycles ⋮ Computational complexity of finite asynchronous cellular automata ⋮ Supercritical probabilistic cellular automata: how effective is the synchronous updating? ⋮ Stochastic minority on graphs ⋮ Some Formal Properties of Asynchronous Cellular Automata ⋮ A non-ergodic probabilistic cellular automaton with a unique invariant measure ⋮ On the complexity of asynchronous freezing cellular automata ⋮ Progresses in the analysis of stochastic 2D cellular automata: a study of asynchronous 2D minority

Cites Work

• Evolutionary games and computer simulations.
• Markov Chains
• Perturbing the Topology of the Game of Life Increases Its Robustness to Asynchrony
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fully asynchronous behavior of double-quiescent elementary cellular automata