Abstract

It is shown that (1) there exists a language L 0 which is generated by a linear grammar and is not T(n) -recognizable by any on-line multitape Turing machine if lim n→∞ T (n)/(n/log n) 2 = 0, and (2) any language generated by a linear grammar is n 2 -recognizable by an on-line single-tape Turing machine in the sense of Hartmanis and Stearns.

Full Text
Published version (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