Boosting Reversible Pushdown and Queue Machines by Preprocessing

DOI10.1142/S0129054120420022zbMath1458.68083OpenAlexW3112829113MaRDI QIDQ5859661

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

Publication date: 19 April 2021

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054120420022

zbMATH Keywords

finite-state transducersreversible computationsreversible pushdown automatareversible queue automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• QRT FIFO automata, breadth-first grammars and their relations
• Reversible pushdown automata
• One-way reversible multi-head finite automata
• Über einen Automaten mit Pufferspeicherung
• A Hierarchy of Fast Reversible Turing Machines
• Aspects of Reversibility for Classical Automata
• When input-driven pushdown automata meet reversiblity
• Boosting Reversible Pushdown Machines by Preprocessing
• Reversible Queue Automata
• Queue Automata: Foundations and Developments