{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,2]],"date-time":"2023-10-02T15:27:54Z","timestamp":1696260474592},"reference-count":13,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1967,7,1]],"date-time":"1967-07-01T00:00:00Z","timestamp":-79056000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2014,5,15]],"date-time":"2014-05-15T00:00:00Z","timestamp":1400112000000},"content-version":"vor","delay-in-days":17120,"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":[[1967,7]]},"DOI":"10.1016\/s0019-9958(67)90369-5","type":"journal-article","created":{"date-parts":[[2004,12,15]],"date-time":"2004-12-15T06:51:40Z","timestamp":1103093500000},"page":"30-70","source":"Crossref","is-referenced-by-count":48,"title":["Two-way pushdown automata"],"prefix":"10.1016","volume":"11","author":[{"given":"James N.","family":"Gray","sequence":"first","affiliation":[]},{"given":"Michael A.","family":"Harrison","sequence":"additional","affiliation":[]},{"given":"Oscar H.","family":"Ibarra","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0019-9958(67)90369-5_bib1","first-page":"143","article-title":"On formal properties of simple phrase structure grammars","volume":"14","author":"Bar-Hillel","year":"1961","journal-title":"Z. Phonetik Sprachwissen. Kommunikationsforsch."},{"key":"10.1016\/S0019-9958(67)90369-5_bib2","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF01969548","article-title":"Regular Canonical Systems","volume":"6","author":"B\u00fcchi","year":"1964","journal-title":"Arch. Math. Logik Grundlagenforsch."},{"key":"10.1016\/S0019-9958(67)90369-5_bib3","article-title":"Context-free Grammars and Pushdown Storage","author":"Chomsky","year":"1962"},{"key":"10.1016\/S0019-9958(67)90369-5_bib4","series-title":"Computability and Unsolvability","author":"Davis","year":"1958"},{"key":"10.1016\/S0019-9958(67)90369-5_bib5","series-title":"The Mathematical Theory of Context Free Languages","author":"Ginsburg","year":"1966"},{"key":"10.1016\/S0019-9958(67)90369-5_bib6","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. and Control"},{"key":"10.1016\/S0019-9958(67)90369-5_bib7","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1145\/321371.321385","article-title":"Stack Automata and Compiling","volume":"14","author":"Ginsburg","year":"1967","journal-title":"J. ACM"},{"key":"10.1016\/S0019-9958(67)90369-5_bib8","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1145\/321386.321403","article-title":"One-way Stack Automata","volume":"14","author":"Ginsburg","year":"1967","journal-title":"J. ACM"},{"key":"10.1016\/S0019-9958(67)90369-5_bib9","series-title":"Introduction to Switching and Automata Theory","author":"Harrison","year":"1965"},{"key":"10.1016\/S0019-9958(67)90369-5_bib10","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1016\/S0019-9958(64)90120-2","article-title":"Classes of languages and linear bounded automata","volume":"7","author":"Kuroda","year":"1964","journal-title":"Inform. Control"},{"key":"10.1016\/S0019-9958(67)90369-5_bib11","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1147\/rd.32.0114","article-title":"Finite Automata and their Decision Problems","volume":"3","author":"Rabin","year":"1959","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/S0019-9958(67)90369-5_bib12","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1147\/rd.32.0198","article-title":"The Reduction of Two-Way Automata to One-way Automata","volume":"3","author":"Shepherdson","year":"1959","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/S0019-9958(67)90369-5_bib13","series-title":"Proceedings of the 1965 Conference on Switching Circuit Theory and Logical Design","first-page":"179","article-title":"Hierarchies of memory limited computations","author":"Stearns","year":"1965"}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995867903695?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995867903695?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,31]],"date-time":"2019-01-31T14:53:31Z","timestamp":1548946411000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0019995867903695"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1967,7]]},"references-count":13,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1967,7]]}},"alternative-id":["S0019995867903695"],"URL":"http:\/\/dx.doi.org\/10.1016\/s0019-9958(67)90369-5","relation":{},"ISSN":["0019-9958"],"issn-type":[{"value":"0019-9958","type":"print"}],"subject":[],"published":{"date-parts":[[1967,7]]}}}
