Pages that link to "Item:Q4976415"
From MaRDI portal
The following pages link to Computing Modulo-n by Composing Cellular Automata Rules (Q4976415):
Displaying 3 items.
- A perfect solution to the parity problem with elementary cellular automaton 150 under asynchronous update (Q2215009) (← links)
- MODULO THREE PROBLEM WITH A CELLULAR AUTOMATON SOLUTION (Q5716110) (← links)
- Generalisation of a synchronous solution of the parity problem on cyclic configurations over a non-circulant graph (Q6539381) (← links)