Abstract
A well-known open problem in computational complexity is to find an easily specified language not recognized by any log 2 n tape-bounded Turing machine. It is known that the log 2 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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
