Reversible queue automata

DOI10.3233/FI-2016-1438MaRDI QIDQ4589239zbMATH OpenFDO

Authors Martin Kutrib, Andreas Malcher, Matthias Wendlandt

Publication date 9 November 2017

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/FI-2016-1438

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Reversible pushdown automata
• Boosting reversible pushdown and queue machines by preprocessing
• Reversible pushdown automata
• Reversible and irreversible computations of deterministic finite-state devices
• Reversible nondeterministic finite automata

Cited in

(12)

• Reversibility for stateless ordered RRWW-automata
• Reachability problems on partially lossy queue automata
• Input-Driven Queue Automata with Internal Transductions
• Aspects of reversibility for classical automata
• Reversible limited automata
• Reversible and irreversible computations of deterministic finite-state devices
• scientific article; zbMATH DE number 3845055 (Why is no real title available?)
• Queue Automata: Foundations and Developments
• Diving into the queue
• Boosting reversible pushdown and queue machines by preprocessing
• Reversible pushdown transducers
• Reversible Two-Party Computations

This page was built for publication: Reversible queue automata

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