Two-Way Reversible Multi-Head Finite Automata

Authors:
Kenichi Morita
Affiliations:
(Correspd.) Department of Information Engineering, Hiroshima University, Higashi-Hiroshima, 739-8527, Japan. morita@iec.hiroshima-u.ac.jp
Venue:
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
Year:
2011

Citing 10
Cited 2

Universality of a reversible two-counter machine

Theoretical Computer Science - Special issue on universal machines and computations
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 Computing

Proceedings of the 7th Colloquium on Automata, Languages and Programming
Reversible computing and cellular automata—A survey

Theoretical Computer Science
Finite automata and their decision problems

IBM Journal of Research and Development
On multi-head finite automata

IBM Journal of Research and Development
Logical reversibility of computation

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

Journal of Computer and System Sciences
Complexity of multi-head finite automata: Origins and directions

Theoretical Computer Science
Reversible pushdown automata

LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications

Reversible multi-head finite automata characterize reversible logarithmic space

LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Time-Symmetric machines

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

A two-way reversible multi-head finite automaton (RMFA) is introduced as a simple model of reversible computing, and its language accepting capability is studied. We show that various non-regular context-free languages, and non-context-free context-sensitive languages are accepted by RMFAs with a few heads. For example, we give an RMFA with three heads that accepts the language consisting of all words whose length is a prime number. A construction method of a garbage-less RMFA from a given RFMA is also shown.