{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T23:10:33Z","timestamp":1771024233993,"version":"3.50.1"},"reference-count":10,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1968,9,1]],"date-time":"1968-09-01T00:00:00Z","timestamp":-42076800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,18]],"date-time":"2013-07-18T00:00:00Z","timestamp":1374105600000},"content-version":"vor","delay-in-days":16391,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Control"],"published-print":{"date-parts":[[1968,9]]},"DOI":"10.1016\/s0019-9958(68)91087-5","type":"journal-article","created":{"date-parts":[[2004,12,15]],"date-time":"2004-12-15T01:51:40Z","timestamp":1103075500000},"page":"186-206","source":"Crossref","is-referenced-by-count":60,"title":["Time and tape complexity of pushdown automaton languages"],"prefix":"10.1016","volume":"13","author":[{"given":"A.V.","family":"Aho","sequence":"first","affiliation":[]},{"given":"J.E.","family":"Hopcroft","sequence":"additional","affiliation":[]},{"given":"J.D.","family":"Ullman","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0019-9958(68)91087-5_bib1","series-title":"Quarterly Progress Report No. 65","article-title":"Context-free grammars and pushdown storage","author":"Chomsky","year":"1965"},{"key":"10.1016\/S0019-9958(68)91087-5_bib2","series-title":"An n2-recognizer for context free grammars","author":"Earley","year":"1967"},{"key":"10.1016\/S0019-9958(68)91087-5_bib3","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1016\/S0019-9958(66)80019-0","article-title":"Deterministic context-free languages","volume":"9","author":"Ginsburg","year":"1966","journal-title":"Inform. Control"},{"key":"10.1016\/S0019-9958(68)91087-5_bib4","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/S0019-9958(67)90369-5","article-title":"Two-way pushdown automata","volume":"11","author":"Gray","year":"1967","journal-title":"Inform. Control"},{"key":"10.1016\/S0019-9958(68)91087-5_bib5","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1090\/S0002-9947-1965-0170805-7","article-title":"On the computational complexity of algorithms","volume":"117","author":"Hartmanis","year":"1965","journal-title":"Trans. Am. Math. Soc."},{"key":"10.1016\/S0019-9958(68)91087-5_bib6","unstructured":"Hopcroft, J. E. and Ullman, J. D., \u201cThe Theory of Languages and Their Relation to Automata.\u201d Addison-Wesley, Reading, Massachusetts. In press."},{"key":"10.1016\/S0019-9958(68)91087-5_bib7","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1016\/S0019-9958(65)90426-2","article-title":"On the translation of languages from left to right","volume":"8","author":"Knuth","year":"1965","journal-title":"Inform. Control"},{"key":"10.1016\/S0019-9958(68)91087-5_bib8","series-title":"1965 IEEE Conf. Record Switching Circ. Theory and Log. Des.","first-page":"191","article-title":"Memory bounds for recognition of context-free and context sensitive languages","author":"Lewis","year":"1965"},{"key":"10.1016\/S0019-9958(68)91087-5_bib9","series-title":"1965 IEEE Conf. Record Switching Circ. Theory and Log. Des.","first-page":"179","article-title":"Hiorarchies of memory limited computations","author":"Stearns","year":"1965"},{"key":"10.1016\/S0019-9958(68)91087-5_bib10","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0019-9958(67)80007-X","article-title":"Recognition and parsing of context free languages in time n3","volume":"10","author":"Younger","year":"1967","journal-title":"Inform. Control"}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995868910875?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995868910875?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,31]],"date-time":"2019-01-31T09:52:15Z","timestamp":1548928335000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0019995868910875"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1968,9]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1968,9]]}},"alternative-id":["S0019995868910875"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(68)91087-5","relation":{},"ISSN":["0019-9958"],"issn-type":[{"value":"0019-9958","type":"print"}],"subject":[],"published":{"date-parts":[[1968,9]]}}}