Transducing reversibly with finite state machines

DOI10.1007/978-3-319-60134-2_13zbMath1429.68121OpenAlexW2617802917MaRDI QIDQ5920055

Andreas Malcher, Matthias Wendlandt, Martin Kutrib

Publication date: 22 August 2017

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-60134-2_13

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Reversible space equals deterministic space
• Reversible pushdown automata
• A Hierarchy of Fast Reversible Turing Machines
• Deterministic Stack Transducers
• Two-Way Reversible Multi-Head Finite Automata
• Minimal Reversible Deterministic Finite Automata
• One-Way Reversible Multi-head Finite Automata
• Irreversibility and Heat Generation in the Computing Process
• Inference of Reversible Languages
• A general theory of translation
• Logical Reversibility of Computation

This page was built for publication: Transducing reversibly with finite state machines