{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T02:59:23Z","timestamp":1767927563733,"version":"3.49.0"},"reference-count":6,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1980,4,1]],"date-time":"1980-04-01T00:00:00Z","timestamp":323395200000},"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":12161,"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":[[1980,4]]},"DOI":"10.1016\/s0019-9958(80)90867-0","type":"journal-article","created":{"date-parts":[[2004,12,15]],"date-time":"2004-12-15T09:12:12Z","timestamp":1103101932000},"page":"48-67","source":"Crossref","is-referenced-by-count":16,"title":["On deterministic indexed languages"],"prefix":"10.1016","volume":"45","author":[{"given":"R.","family":"Parchmann","sequence":"first","affiliation":[]},{"given":"J.","family":"Duske","sequence":"additional","affiliation":[]},{"given":"J.","family":"Specht","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0019-9958(80)90867-0_bib1","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1145\/321479.321488","article-title":"Indexed grammars","volume":"15","author":"Aho","year":"1968","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0019-9958(80)90867-0_bib2","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1145\/321526.321529","article-title":"Nested stack automata","volume":"16","author":"Aho","year":"1969","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0019-9958(80)90867-0_bib3","volume":"Vol. I","author":"Aho","year":"1972"},{"key":"10.1016\/S0019-9958(80)90867-0_bib4","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0022-0000(78)90012-0","article-title":"Pumping lemmas for term languages","volume":"17","author":"Maibaum","year":"1978","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0019-9958(80)90867-0_bib5","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1145\/321510.321517","article-title":"A direct proof of the inherent ambiguity of a simple context-free language","volume":"16","author":"Maurer","year":"1969","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0019-9958(80)90867-0_bib6","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1137\/0207032","article-title":"Polynomial algorithms for deterministic pushdown automata","volume":"7","author":"Rosenkrantz","year":"1978","journal-title":"SIAM J. Comput."}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995880908670?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995880908670?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,31]],"date-time":"2019-01-31T13:54:00Z","timestamp":1548942840000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0019995880908670"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,4]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1980,4]]}},"alternative-id":["S0019995880908670"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(80)90867-0","relation":{},"ISSN":["0019-9958"],"issn-type":[{"value":"0019-9958","type":"print"}],"subject":[],"published":{"date-parts":[[1980,4]]}}}