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.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
