Reversible Limited Automata
From MaRDI portal
Publication:2945882
DOI10.1007/978-3-319-23111-2_8zbMath1415.68136OpenAlexW2229846802MaRDI QIDQ2945882
Martin Kutrib, Matthias Wendlandt
Publication date: 15 September 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-23111-2_8
Related Items (6)
Reversible effects as inverse arrows ⋮ Deterministic Stack Transducers ⋮ Reversible and Irreversible Computations of Deterministic Finite-State Devices ⋮ Join inverse categories and reversible recursion ⋮ Join Inverse Categories as Models of Reversible Recursion ⋮ Deterministic Stack Transducers
Cites Work
- Unnamed Item
- Reversible computing and cellular automata -- a survey
- Fast reversible language recognition using cellular automata
- Quantum mechanical ground state of hydrogen obtained from classical electrodynamics
- Reversible space equals deterministic space
- Reversible pushdown automata
- The nature of explosive percolation phase transition
- Limited Automata and Context-Free Languages
- Reversible Multi-head Finite Automata Characterize Reversible Logarithmic Space
- Aspects of Reversibility for Classical Automata
- ON STATELESS TWO-PUSHDOWN AUTOMATA AND RESTARTING AUTOMATA
- Degrees of Reversibility for DFA and DPDA
- WHEN CHURCH-ROSSER BECOMES CONTEXT FREE
- Minimal Reversible Deterministic Finite Automata
- One-Way Reversible Multi-head Finite Automata
- A Deterministic Two-Way Multi-head Finite Automaton Can Be Converted into a Reversible One with the Same Number of Heads
- Inference of Reversible Languages
- Reversible Queue Automata
- LIMITED AUTOMATA AND REGULAR LANGUAGES
- Complexities for Generalized Models of Self-Assembly
- Weight-Reducing Hennie Machines and Their Descriptional Complexity
- On Simulation Cost of Unary Limited Automata
- Computational Complexity of One-Tape Turing Machine Computations
- One-tape, off-line Turing machine computations
- Logical Reversibility of Computation
- Pisot substitutions and Rauzy fractals
- Non-Turing computations via Malament--Hogarth space-times
This page was built for publication: Reversible Limited Automata
