One-way reversible multi-head finite automata
From MaRDI portal
Publication:2358688
DOI10.1016/j.tcs.2016.11.006zbMath1371.68156OpenAlexW2553644099MaRDI QIDQ2358688
Martin Kutrib, Andreas Malcher
Publication date: 15 June 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.11.006
Related Items
Unnamed Item, Queue Automata: Foundations and Developments, Reversible Two-Party Computations, Reversibility of computations in graph-walking automata, Reversible parallel communicating finite automata systems, An instruction set for reversible Turing machines, Transducing reversibly with finite state machines, Boosting Reversible Pushdown and Queue Machines by Preprocessing
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Head and state hierarchies for unary multi-head finite automata
- Real-time reversible iterative arrays
- Reversible computing and cellular automata -- a survey
- Fast reversible language recognition using cellular automata
- Reversible pushdown automata
- One way multihead deterministic finite automata
- On non-determinacy in simple computing devices
- Reversing algebraic process calculi
- Set Automata
- Reversible Multi-head Finite Automata Characterize Reversible Logarithmic Space
- Two-Way Reversible Multi-Head Finite Automata
- Reversible Flowchart Languages and the Structured Reversible Program Theorem
- Irreversibility and Heat Generation in the Computing Process
- On the Succinctness of Different Representations of Languages
- Inference of Reversible Languages
- One-way multihead writing finite automata
- k + 1 Heads Are Better than k
- Real-Time Reversible One-Way Cellular Automata
- On Multi-Head Finite Automata
- Logical Reversibility of Computation
- THE PHENOMENON OF NON-RECURSIVE TRADE-OFFS
