Pages that link to "Item:Q672388"
From MaRDI portal
The following pages link to Reversible simulation of one-dimensional irreversible cellular automata (Q672388):
Displaying 22 items.
- Reversible top-down syntax analysis (Q832945) (← 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)
- Reversible computation in term rewriting (Q1683707) (← links)
- Intrinsically universal \(n\)-dimensional quantum cellular automata (Q1757844) (← links)
- Partitioned quantum cellular automata are intrinsically universal (Q1761701) (← links)
- How to turn a second-order cellular automaton into a lattice gas: a new inversion scheme (Q1884855) (← links)
- Reversible parallel communicating finite automata systems (Q2041681) (← links)
- A single-copy minimal-time simulation of a torus of automata by a ring of automata (Q2384397) (← links)
- Computation in reversible cellular automata (Q2869782) (← links)
- Aspects of Reversibility for Classical Automata (Q2944881) (← links)
- Reversible and Irreversible Computations of Deterministic Finite-State Devices (Q2946323) (← links)
- When input-driven pushdown automata meet reversiblity (Q2969982) (← links)
- Reversible Causal Graph Dynamics (Q3186585) (← links)
- Intrinsic universality of a 1-dimensional reversible Cellular Automaton (Q5048944) (← links)
- Simulation and Intrinsic Universality Among Reversible Cellular Automata, the Partition Cellular Automata Leverage (Q5112164) (← links)
- Simple Block-Substitution Rule Exhibits Interesting Patterns (Q5112185) (← links)
- A survey of cellular automata: types, dynamics, non-uniformity and applications (Q6151179) (← links)
- Reversible Top-Down Syntax Analysis (Q6169965) (← links)
- The complexity of iterated reversible computation (Q6566596) (← links)
