Boosting reversible pushdown machines by preprocessing

DOI10.1007/978-3-319-40578-0_6MaRDI QIDQ3186586zbMATH OpenOpenAlexFDO

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

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

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

Recommendations

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

Cites work

• A hierarchy of fast reversible Turing machines
• Aspects of reversibility for classical automata
• Finite-Turn Pushdown Automata
• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• Reversible pushdown automata

Cited in

(7)

• Boosting pushdown and queue machines by preprocessing
• Reversible pushdown automata
• The degree of irreversibility in deterministic finite automata
• Reversible pushdown automata
• The degree of irreversibility in deterministic finite automata
• Boosting reversible pushdown and queue machines by preprocessing
• Reversible top-down syntax analysis

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

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