|
| 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
| ASCII Text | x | ||
| 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. | |||
| BibTex | x | ||
| @article{ 10.1109/T-C.1970.223008, author = {T.F. Arnold}, title = {R70-21 Time and Tape Complexity of Pushdown Automaton Languages}, journal ={IEEE Transactions on Computers}, volume = {19}, number = {7}, issn = {0018-9340}, year = {1970}, pages = {658-659}, doi = {http://doi.ieeecomputersociety.org/10.1109/T-C.1970.223008}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - R70-21 Time and Tape Complexity of Pushdown Automaton Languages IS - 7 SN - 0018-9340 SP658 EP659 EPD - 658-659 A1 - T.F. Arnold, PY - 1970 KW - null VL - 19 JA - IEEE Transactions on Computers ER - | |||
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.