Asynchronous cellular systems that solve the parity problem
From MaRDI portal
Recommendations
- A perfect solution to the parity problem with elementary cellular automaton 150 under asynchronous update
- scientific article; zbMATH DE number 7339755
- Synchronous solution of the parity problem on cyclic configurations, with elementary cellular automaton rule 150, over a family of directed, non-circulant, regular graphs
- Solving the parity problem in one-dimensional cellular automata
- Solving the parity problem with rule 60 in array size of the power of two
Cites work
- A perfect solution to the parity problem with elementary cellular automaton 150 under asynchronous update
- An asynchronous solution to the synchronisation problem for binary one-dimensional cellular automata
- Brownian cellular automata
- Lost in self-stabilization: a local process that aligns connected cells
- Remarks on the cellular automaton global synchronisation problem: deterministic versus stochastic models
- Solving the parity problem in one-dimensional cellular automata
- Stochastic cellular automata solutions to the density classification problem. When randomness helps computing
- Synchronous solution of the parity problem on cyclic configurations, with elementary cellular automaton rule 150, over a family of directed, non-circulant, regular graphs
This page was built for publication: Asynchronous cellular systems that solve the parity problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6637844)