Publication
Journal of Computer and System Sciences
Paper

Multitape finite automata with rewind instructions

View publication

Abstract

The model of multitape finite automaton is generalized by allowing the automaton to rewind all its tapes simultaneously at any stage in its computation. This added capability is shown to yeild the Boolean closure of the class of word relations defined by multitape finite automata. Several properties of this extended model are investigated. In particular it is shown that this model is incomparable to the nondeterministic multitape finite automata and is strictly weaker than two-way multitape finite automata. © 1967 Academic Press Inc.

Date

01 Oct 1967

Publication

Journal of Computer and System Sciences

Authors

Topics

Share