This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
July 1970 (vol. 19 no. 7)
pp. 658-659
T.F. Arnold, Bell Telephone Labs.
This paper is concerned with the recognition of words which are contained in languages defined by pushdown store machines. Such languages exhibit many of the syntactic properties of algorithmic programming languages. Thus the recognition problem for languages generated by pushdown store machines is related to compilation of programming languages.
Citation:
T.F. Arnold, "R70-21 Time and Tape Complexity of Pushdown Automaton Languages," IEEE Transactions on Computers, vol. 19, no. 7, pp. 658-659, July 1970, doi:10.1109/T-C.1970.223008
Usage of this product signifies your acceptance of the Terms of Use.