Reversible queue automata

DOI10.3233/FI-2016-1438zbMATH Open1374.68261MaRDI QIDQ4589239FDOQ4589239

Authors: Martin Kutrib, Andreas Malcher, Matthias Wendlandt 

Publication date: 9 November 2017

Published in: Fundamenta Informaticae (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (11)

• Boosting Reversible Pushdown and Queue Machines by Preprocessing
• Reversible and Irreversible Computations of Deterministic Finite-State Devices
• Diving into the queue
• Input-Driven Queue Automata with Internal Transductions
• Reversible Limited Automata
• Reversibility for stateless ordered RRWW-automata
• Aspects of Reversibility for Classical Automata
• Reversible Two-Party Computations
• Title not available (Why is that?)
• Reversible pushdown transducers
• Queue Automata: Foundations and Developments

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)