Boosting reversible pushdown and queue machines by preprocessing

DOI10.1142/S0129054120420022MaRDI QIDQ5859661zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• Boosting reversible pushdown machines by preprocessing
• Boosting pushdown and queue machines by preprocessing
• Reversible pushdown automata
• Reversible queue automata
• Reversible pushdown automata

Cites work

• A hierarchy of fast reversible Turing machines
• Aspects of reversibility for classical automata
• Boosting reversible pushdown machines by preprocessing
• scientific article; zbMATH DE number 107774 (Why is no real title available?)
• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• One-way reversible multi-head finite automata
• QRT FIFO automata, breadth-first grammars and their relations
• Queue Automata: Foundations and Developments
• Reversible pushdown automata
• Reversible queue automata
• When input-driven pushdown automata meet reversiblity
• Über einen Automaten mit Pufferspeicherung

Cited in

(4)

• Boosting pushdown and queue machines by preprocessing
• Boosting reversible pushdown machines by preprocessing
• Reversible queue automata
• Sweeping input-driven pushdown automata

This page was built for publication: Boosting reversible pushdown and queue machines by preprocessing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5859661)