A Two-Way Automaton with Fewer States than Any Equivalent One-Way Automaton

Authors:
B. H. Barnes
Affiliations:
Dep. Comput. Sci. Pennsylvania State Univ.
Venue:
IEEE Transactions on Computers
Year:
1971

Citing 2
Cited 3

Finite automata and their decision problems

IBM Journal of Research and Development
The reduction of two-way automata to one-way automata

IBM Journal of Research and Development

Deterministic moles cannot solve liveness

Journal of Automata, Languages and Combinatorics
Removing bidirectionality from nondeterministic finite automata

MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Minicomplexity

DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems

Quantified Score

Hi-index	14.98

Visualization

Abstract

This correspondence presents an example of a two-way automaton which has significantly fewer states than any one-way automaton accepting the same set of tapes. Thus, in this particular case, memory space can be saved by using a two-way automaton. This savings in space, however, is accompanied by an increase in recognition time.