A Simple and Efficient Universal Reversible Turing Machine

DOI10.1007/978-3-642-21254-3_8zbMath1330.68066OpenAlexW2246201930MaRDI QIDQ3004571

Robert Glück, Holger Bock Axelsen

Publication date: 3 June 2011

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21254-3_8

Mathematics Subject Classification ID

Related Items (12)

On reversible Turing machines and their function universality ⋮ Aspects of Reversibility for Classical Automata ⋮ Reversible and Irreversible Computations of Deterministic Finite-State Devices ⋮ Logical depth for reversible Turing machines with an application to the rate of decrease in logical depth for general Turing machines ⋮ Fundamentals of reversible flowchart languages ⋮ Towards a taxonomy for reversible computation approaches ⋮ Clean Reversible Simulations of Ranking Binary Trees ⋮ Reversible computing from a programming language perspective ⋮ Minimal Reversible Deterministic Finite Automata ⋮ When input-driven pushdown automata meet reversiblity ⋮ Unnamed Item ⋮ Quantum Reversible Fuzzy Grammars

This page was built for publication: A Simple and Efficient Universal Reversible Turing Machine