{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T11:35:32Z","timestamp":1774956932114,"version":"3.50.1"},"reference-count":19,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1974,6,1]],"date-time":"1974-06-01T00:00:00Z","timestamp":139276800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":14291,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1974,6]]},"DOI":"10.1016\/s0022-0000(74)80027-9","type":"journal-article","created":{"date-parts":[[2010,11,10]],"date-time":"2010-11-10T09:46:40Z","timestamp":1289382400000},"page":"315-332","source":"Crossref","is-referenced-by-count":196,"title":["Reversal-bounded multipushdown machines"],"prefix":"10.1016","volume":"8","author":[{"given":"Brenda S.","family":"Baker","sequence":"first","affiliation":[]},{"given":"Ronald V.","family":"Book","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(74)80027-9_bib1","unstructured":"B. Baker, On finding \u201csmall\u201d integer solutions to sets of linear equations, submitted for publication."},{"key":"10.1016\/S0022-0000(74)80027-9_bib2","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1137\/0201019","article-title":"On languages accepted in polynomial time","volume":"1","author":"Book","year":"1972","journal-title":"SIAM J. Computing"},{"key":"10.1016\/S0022-0000(74)80027-9_bib3","series-title":"Computer Programming and Formal Systems","first-page":"118","article-title":"The algebraic theory of context-free languages","author":"Chomsky","year":"1967"},{"key":"10.1016\/S0022-0000(74)80027-9_bib4","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/S0022-0000(68)80028-5","article-title":"The reduction of tape reversals for off-line one-tape Turing machines","volume":"2","author":"Fischer","year":"1968","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(74)80027-9_bib5","author":"Ginsburg","year":"1966"},{"key":"10.1016\/S0022-0000(74)80027-9_bib6","series-title":"Proceedings of the Third ACM Symposium on Theory of Computing","first-page":"121","article-title":"Intersection-closed full AFL and the recursively enumerable languages","author":"Ginsburg","year":"1971"},{"key":"10.1016\/S0022-0000(74)80027-9_bib7","first-page":"1","article-title":"Abstract families of languages","volume":"87","author":"Ginsburg","year":"1969","journal-title":"Mem. Amer. Math. Soc."},{"key":"10.1016\/S0022-0000(74)80027-9_bib8","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/S0022-0000(70)80016-2","article-title":"Principal AFL","volume":"4","author":"Ginsburg","year":"1970","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(74)80027-9_bib9","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. Assoc. Comput. Mach."},{"key":"10.1016\/S0022-0000(74)80027-9_bib10","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1137\/0304034","article-title":"Finite-turn pushdown automata","volume":"4","author":"Ginsburg","year":"1966","journal-title":"SIAM J. Control"},{"key":"10.1016\/S0022-0000(74)80027-9_bib11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01691341","article-title":"A note on undecidable properties of formal languages","volume":"2","author":"Greibach","year":"1968","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0022-0000(74)80027-9_bib12","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1145\/321495.321503","article-title":"An infinite hierarchy of context-free languages","volume":"16","author":"Greibach","year":"1969","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0022-0000(74)80027-9_bib13","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1137\/0202025","article-title":"The hardest context-free language","volume":"2","author":"Greibach","year":"1973","journal-title":"SIAM J. Computing"},{"key":"10.1016\/S0022-0000(74)80027-9_bib14","first-page":"192","article-title":"Multi-tape AFA","volume":"19","author":"Greibach","year":"1972","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0022-0000(74)80027-9_bib15","first-page":"42","article-title":"Context-free languages and Turing machine computations","volume":"19","author":"Hartmanis","year":"1967"},{"key":"10.1016\/S0022-0000(74)80027-9_bib16","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0022-0000(68)80027-3","article-title":"Tape-reversal bounded Turing machine computations","volume":"2","author":"Hartmanis","year":"1968","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(74)80027-9_bib17","first-page":"196","article-title":"What makes some language theory problems undecidable","volume":"3","author":"Hartmanis","year":"1969","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(74)80027-9_bib18","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/S0019-9958(70)90549-8","article-title":"Note on tape reversal complexity of languages","volume":"17","author":"Kameda","year":"1970","journal-title":"Information and Control"},{"key":"10.1016\/S0022-0000(74)80027-9_bib19","series-title":"Proceedings of the 6th Princeton Conference on Information Science and Systems","article-title":"Normal form theorems for phrase structure grammars","author":"Savitch","year":"1972"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000074800279?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000074800279?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,6]],"date-time":"2018-12-06T23:52:20Z","timestamp":1544140340000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000074800279"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1974,6]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1974,6]]}},"alternative-id":["S0022000074800279"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(74)80027-9","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1974,6]]}}}