Pages that link to "Item:Q3100940"
From MaRDI portal
The following pages link to Two-Way Reversible Multi-Head Finite Automata (Q3100940):
Displaying 23 items.
- Join inverse categories and reversible recursion (Q511931) (← links)
- Theory of reaction automata: a survey (Q1983008) (← links)
- Reversible parallel communicating finite automata systems (Q2041681) (← links)
- Reversible effects as inverse arrows (Q2134817) (← links)
- Reversibility of computations in graph-walking automata (Q2216129) (← links)
- One-way reversible multi-head finite automata (Q2358688) (← links)
- Reversible Watson-Crick automata (Q2406432) (← links)
- Join Inverse Categories as Models of Reversible Recursion (Q2811333) (← 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)
- One-Way Reversible Multi-head Finite Automata (Q3453731) (← links)
- A Deterministic Two-Way Multi-head Finite Automaton Can Be Converted into a Reversible One with the Same Number of Heads (Q3453732) (← links)
- Minimal Reversible Deterministic Finite Automata (Q4640040) (← links)
- The Computing Power of Determinism and Reversibility in Chemical Reaction Automata (Q5112176) (← links)
- Queue Automata: Foundations and Developments (Q5112182) (← links)
- On the power of two-way multihead quantum finite automata (Q5223828) (← links)
- Real-Time Reversible One-Way Cellular Automata (Q5501613) (← links)
- Language Recognition by Reversible Partitioned Cellular Automata (Q5501617) (← links)
- (Q5867516) (← links)
- Transducing reversibly with finite state machines (Q5919580) (← links)
- Transducing reversibly with finite state machines (Q5920055) (← links)
- Reversible Two-Party Computations (Q6204131) (← links)
