This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
J. Hartmanis, Dept. of Computer Science Cornell University
Although considerable progress has been made in the understanding of the more "algebraic" properties of context-free languages, the quantitative aspects of the recognition and parsing of context- free languages are still far from well understood. It was shown by Kasami and Younger that for every context-free language there exists a multitape Turing machine which recognizes this language and uses n
Citation:
J. Hartmanis, "R70-1 A Note on Computing Time for the Recognition of Context- Free Languages by a Single-Tape Turing Machine," IEEE Transactions on Computers, vol. 19, no. 5, pp. 463, May 1970, doi:10.1109/T-C.1970.222952
Usage of this product signifies your acceptance of the Terms of Use.