One-Way Reversible Multi-head Finite Automata

DOI10.1007/978-3-642-36315-3_2zbMath1451.68152OpenAlexW1463964857MaRDI QIDQ3453731

Martin Kutrib, Andreas Malcher

Publication date: 30 November 2015

Published in: Reversible Computation (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (11)

On reversible Turing machines and their function universality ⋮ Reversible Watson-Crick automata ⋮ Aspects of Reversibility for Classical Automata ⋮ Reversible Limited Automata ⋮ Reversible and Irreversible Computations of Deterministic Finite-State Devices ⋮ Minimal Reversible Deterministic Finite Automata ⋮ When input-driven pushdown automata meet reversiblity ⋮ Watson-Crick quantum finite automata ⋮ Transducing reversibly with finite state machines ⋮ On the power of two-way multihead quantum finite automata ⋮ Real-Time Reversible One-Way Cellular Automata

Cites Work

• Unnamed Item
• Real-time reversible iterative arrays
• Reversible computing and cellular automata -- a survey
• Fast reversible language recognition using cellular automata
• Reversible pushdown automata
• On non-determinacy in simple computing devices
• Reversing algebraic process calculi
• Reversible Multi-head Finite Automata Characterize Reversible Logarithmic Space
• Two-Way Reversible Multi-Head Finite Automata
• States and Heads Do Count for Unary Multi-head Finite Automata
• Reversible Flowchart Languages and the Structured Reversible Program Theorem
• Irreversibility and Heat Generation in the Computing Process
• Inference of Reversible Languages
• k + 1 Heads Are Better than k
• On Multi-Head Finite Automata
• Logical Reversibility of Computation

This page was built for publication: One-Way Reversible Multi-head Finite Automata