Reversible Multi-head Finite Automata Characterize Reversible Logarithmic Space
From MaRDI portal
Publication:2890183
DOI10.1007/978-3-642-28332-1_9zbMath1351.68132OpenAlexW1808022612MaRDI QIDQ2890183
Publication date: 8 June 2012
Published in: Language and Automata Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-28332-1_9
Formal languages and automata (68Q45) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (10)
One-way reversible multi-head 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 ⋮ Aspects of Reversibility for Classical Automata ⋮ Reversible Limited Automata ⋮ Reversible and Irreversible Computations of Deterministic Finite-State Devices ⋮ Minimal Reversible Deterministic Finite Automata ⋮ When input-driven pushdown automata meet reversiblity ⋮ Reversibility of computations in graph-walking automata ⋮ Reversible parallel communicating finite automata systems
This page was built for publication: Reversible Multi-head Finite Automata Characterize Reversible Logarithmic Space
