Pages that link to "Item:Q2215009"
From MaRDI portal
The following pages link to A perfect solution to the parity problem with elementary cellular automaton 150 under asynchronous update (Q2215009):
Displaying 13 items.
- Solving the parity problem in one-dimensional cellular automata (Q272769) (← links)
- An asynchronous solution to the synchronisation problem for binary one-dimensional cellular automata (Q2077625) (← links)
- From multiple to single updates per cell in elementary cellular automata with neighbourhood based priority (Q2086703) (← links)
- Characterisation of the elementary cellular automata with neighbourhood priority based deterministic updates (Q2247031) (← links)
- Improvement of a result on sequencing elementary cellular automata rules for solving the parity problem (Q2811954) (← links)
- (Q3814817) (← links)
- Synchronous solution of the parity problem on cyclic configurations, with elementary cellular automaton rule 150, over a family of directed, non-circulant, regular graphs (Q6125207) (← links)
- A tutorial on elementary cellular automata with fully asynchronous updating. General properties and convergence dynamics (Q6151165) (← links)
- Asynchronous communicating cellular automata: formalization, robustness and equivalence (Q6154787) (← links)
- Generalisation of a synchronous solution of the parity problem on cyclic configurations over a non-circulant graph (Q6539381) (← links)
- Asynchronous cellular systems that solve the parity problem (Q6637844) (← links)
- No six-cell neighborhood cellular automaton solves the parity problem (Q6639741) (← links)
- A comprehensive taxonomy of cellular automata (Q6649242) (← links)