Two-Way Reversible Multi-Head Finite Automata

DOI10.3233/FI-2011-541zbMath1234.68230OpenAlexW159651414MaRDI QIDQ3100940

Kenichi Morita

Publication date: 22 November 2011

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

Full work available at URL: https://doi.org/10.3233/fi-2011-541

zbMATH Keywords

reversible computinglanguage recognitionmulti-head finite automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (23)

One-way reversible multi-head finite automata ⋮ Reversible effects as inverse arrows ⋮ One-Way Reversible Multi-head Finite Automata ⋮ A Deterministic Two-Way Multi-head Finite Automaton Can Be Converted into a Reversible One with the Same Number of Heads ⋮ Reversible Watson-Crick automata ⋮ Aspects of Reversibility for Classical Automata ⋮ Reversible and Irreversible Computations of Deterministic Finite-State Devices ⋮ Unnamed Item ⋮ The Computing Power of Determinism and Reversibility in Chemical Reaction Automata ⋮ Queue Automata: Foundations and Developments ⋮ Reversible Two-Party Computations ⋮ Minimal Reversible Deterministic Finite Automata ⋮ When input-driven pushdown automata meet reversiblity ⋮ Reversibility of computations in graph-walking automata ⋮ Theory of reaction automata: a survey ⋮ Join inverse categories and reversible recursion ⋮ Reversible parallel communicating finite automata systems ⋮ Join Inverse Categories as Models of Reversible Recursion ⋮ Transducing reversibly with finite state machines ⋮ Transducing reversibly with finite state machines ⋮ On the power of two-way multihead quantum finite automata ⋮ Real-Time Reversible One-Way Cellular Automata ⋮ Language Recognition by Reversible Partitioned Cellular Automata

This page was built for publication: Two-Way Reversible Multi-Head Finite Automata