Abstract
It is shown that (1) every context-free language is T(n) = n 4 -recognizable by a single-tape Turing machine and (2) every linear context-free language is T(n) = n 2 -recognizable by a single-tape Turing machine. It follows from (2) and a result obtained by Hartmanis (1968) that T(n) = n 2 is a least upper time bound in which every linear context-free language can be recognized by a single-tape Turing machine.
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
