On the Class of Predicates Decidable by Two-Way Multitape Finite Automata

  • Authors:

  • Kojiro Kobayashi;Shigeru Sekiguchi

  • Affiliations:

  • Nippon Electric Company, Kawasaki, Japan;Nippon Electric Company, Kawasaki, Japan

  • Venue:
  • Journal of the ACM (JACM)
  • Year:
  • 1966

Quantified Score

Hi-index 0.00

Visualization

Abstract

The problem of deciding predicates concerned with m-tuples of words by means of 2-way multitape finite automata is considered. In general, more than m tapes are used to decide a predicate concerned with m-tuples of words. In such a way, a necessary and sufficient condition for a predicate to be decidable by a 2-way multitape finite automaton is obtained. The relation between the ability of Turing machines and that of 2-way multitape finite automata is also discussed.