Pages that link to "Item:Q1198089"
From MaRDI portal
The following pages link to Computation-universality of one-dimensional one-way reversible cellular automata (Q1198089):
Displaying 17 items.
- Reversibility of linear cellular automata (Q545985) (← links)
- Simulating reversible Turing machines and cyclic tag systems by one-dimensional reversible cellular automata (Q549699) (← links)
- Reversible simulation of one-dimensional irreversible cellular automata (Q672388) (← links)
- Real-time reversible iterative arrays (Q846369) (← links)
- Fast reversible language recognition using cellular automata (Q948083) (← links)
- Self-reproduction in a reversible cellular space (Q1349866) (← links)
- Reversible space-time simulation of cellular automata (Q1583597) (← links)
- The complexity of reversible cellular automata (Q1884853) (← links)
- How to turn a second-order cellular automaton into a lattice gas: a new inversion scheme (Q1884855) (← links)
- Inverse rules of ECA with rule number 150 (Q2383699) (← links)
- Number-Conserving Reversible Cellular Automata and Their Computation-Universality (Q2773021) (← links)
- Block Representation of Reversible Causal Graph Dynamics (Q2947893) (← links)
- Partial Reversibility of One-Dimensional Cellular Automata (Q3186479) (← links)
- Intrinsic universality of a 1-dimensional reversible Cellular Automaton (Q5048944) (← links)
- Reversible cellular automaton able to simulate any other reversible one using partitioning automata (Q5096335) (← links)
- Abelian Invertible Automata (Q5112163) (← links)
- Simulation and Intrinsic Universality Among Reversible Cellular Automata, the Partition Cellular Automata Leverage (Q5112164) (← links)
