Reversible limited automata
From MaRDI portal
Publication:2945882
DOI10.1007/978-3-319-23111-2_8zbMATH Open1415.68136OpenAlexW2229846802MaRDI QIDQ2945882FDOQ2945882
Authors: 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
Recommendations
Cites Work
- Title not available (Why is that?)
- Complexities for Generalized Models of Self-Assembly
- Pisot substitutions and Rauzy fractals
- Non-Turing computations via Malament--Hogarth space-times
- Logical Reversibility of Computation
- Reversible computing and cellular automata -- a survey
- On stateless two-pushdown automata and restarting automata
- Inference of Reversible Languages
- Quantum mechanical ground state of hydrogen obtained from classical electrodynamics
- One-way reversible multi-head finite automata
- Minimal reversible deterministic finite automata
- Computational Complexity of One-Tape Turing Machine Computations
- One-tape, off-line Turing machine computations
- The nature of explosive percolation phase transition
- Reversible pushdown automata
- Limited automata and context-free languages
- Aspects of reversibility for classical automata
- Degrees of reversibility for DFA and DPDA
- Fast reversible language recognition using cellular automata
- A deterministic two-way multi-head finite automaton can be converted into a reversible one with the same number of heads
- Reversible space equals deterministic space
- Limited automata and regular languages
- Weight-reducing Hennie machines and their descriptional complexity
- When Church-Rosser becomes context free
- Reversible multi-head finite automata characterize reversible logarithmic space
- Reversible queue automata
- On simulation cost of unary limited automata
Cited In (11)
- Reversible Ordered Restarting Automata
- Join inverse categories as models of reversible recursion
- Minimal and Reduced Reversible Automata
- Reversible effects as inverse arrows
- Deterministic stack transducers
- A lower bound for reversible automata
- Behavioral strengths and weaknesses of various models of limited automata
- Deterministic stack transducers
- Join inverse categories and reversible recursion
- Reversible limited automata
- Reversible and irreversible computations of deterministic finite-state devices
This page was built for publication: Reversible limited automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2945882)
