Remarks on the cellular automaton global synchronisation problem: deterministic versus stochastic models
From MaRDI portal
Publication:6191400
DOI10.1007/s11047-018-9683-0zbMath1530.68165OpenAlexW2771651126MaRDI QIDQ6191400
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-018-9683-0
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving the parity problem in one-dimensional cellular automata
- Stochastic cellular automata solutions to the density classification problem. When randomness helps computing
- Density classification on infinite lattices and trees
- Around probabilistic cellular automata
- Lost in self-stabilization: a local process that aligns connected cells
- Solving the density classification problem with a large diffusion and small amplification cellular automaton
- Lyapunov Exponents and Synchronization of Cellular Automata
- Some Investigations About Synchronization and Density Classification Tasks in One-dimensional and Two-dimensional Cellular Automata Rule Spaces
- On the Synchronisation Problem over Cellular Automata
- Proof of a Phase Transition in Probabilistic Cellular Automata
- Remarks on the Cellular Automaton Global Synchronisation Problem
This page was built for publication: Remarks on the cellular automaton global synchronisation problem: deterministic versus stochastic models