Bounded-reversal multihead finite automata languages*

https://doi.org/10.1016/S0019-9958(74)90994-2Get rights and content
Under an Elsevier user license
open archive

A well-known open problem in computational complexity is to find an easily specified language not recognized by any log2 n tape-bounded Turing machine. It is known that the log2 n family is identical to the family of languages recognized by two-way multihead finite automata. Attention here is restricted to those multihead automata which may only reverse each head a fixed constant number of times. It is shown that every bounded language recognized by an automaton from this family satisfies the semilinear property. Thus, easily specified languages which are too complex to be recognized by these restricted multihead automata are obtained.

Cited by (0)

*

This research is supported in part by NSF Grant No. GU-3851.