Reversible multi-head finite automata characterize reversible logarithmic space

Authors:
Holger Bock Axelsen
Affiliations:
DIKU, Department of Computer Science, University of Copenhagen, Denmark
Venue:
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Year:
2012

Citing 10
Cited 1

On the languages accepted by finite reversible automata

14th International Colloquium on Automata, languages and programming
Reversible space equals deterministic space

Journal of Computer and System Sciences - Eleventh annual conference on computational learning theory&slash;Twelfth Annual IEEE conference on computational complexity
Reversible Flowchart Languages and the Structured Reversible Program Theorem

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Logical reversibility of computation

IBM Journal of Research and Development
On two-way multihead automata

Journal of Computer and System Sciences
What do reversible programs compute?

FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
A simple and efficient universal reversible turing machine

LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Reversible pushdown automata

LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Time complexity of tape reduction for reversible turing machines

RC'11 Proceedings of the Third international conference on Reversible Computation
Two-Way Reversible Multi-Head Finite Automata

Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday

Time-Symmetric machines

RC'13 Proceedings of the 5th international conference on Reversible Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Deterministic and non-deterministic multi-head finite automata are known to characterize the deterministic and non- deterministic logarithmic space complexity classes, respectively. Recently, Morita introduced reversible multi-head finite automata (RMFAs), and posed the question of whether RMFAs characterize reversible logarithmic space as well. Here, we resolve the question affirmatively, by exhibiting a clean RMFA simulation of logarithmic space reversible Turing machines. Indirectly, this also proves that reversible and deterministic multi-head finite automata recognize the same languages.