Boosting Reversible Pushdown Machines by Preprocessing

DOI10.1007/978-3-319-40578-0_6zbMath1476.68124OpenAlexW2492494569MaRDI QIDQ3186586

Holger Bock Axelsen, Martin Kutrib, Matthias Wendlandt, Andreas Malcher

Publication date: 10 August 2016

Published in: Reversible Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-40578-0_6

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (3)

The Degree of Irreversibility in Deterministic Finite Automata ⋮ The Degree of Irreversibility in Deterministic Finite Automata ⋮ Boosting Reversible Pushdown and Queue Machines by Preprocessing

Cites Work

• Reversible pushdown automata
• A Hierarchy of Fast Reversible Turing Machines
• Aspects of Reversibility for Classical Automata
• Finite-Turn Pushdown Automata
• Unnamed Item

This page was built for publication: Boosting Reversible Pushdown Machines by Preprocessing