{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T07:44:34Z","timestamp":1778744674920,"version":"3.51.4"},"reference-count":9,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1984,1,1]],"date-time":"1984-01-01T00:00:00Z","timestamp":441763200000},"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":10790,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1984]]},"DOI":"10.1016\/0304-3975(84)90023-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:17:21Z","timestamp":1027657041000},"page":"47-60","source":"Crossref","is-referenced-by-count":38,"title":["Linear indexed languages"],"prefix":"10.1016","volume":"32","author":[{"given":"J.","family":"Duske","sequence":"first","affiliation":[]},{"given":"R.","family":"Parchmann","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(84)90023-9_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. ACM"},{"key":"10.1016\/0304-3975(84)90023-9_BIB2","series-title":"Transductions and Contex-Free Languages","author":"Berstel","year":"1979"},{"key":"10.1016\/0304-3975(84)90023-9_BIB3","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF01692513","article-title":"Control sets on grammars","volume":"2","author":"Ginsburg","year":"1968","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(84)90023-9_BIB4","series-title":"Algebraic and Automata-Theoretic Properties of Formal Languages","author":"Ginsburg","year":"1975"},{"key":"10.1016\/0304-3975(84)90023-9_BIB5","author":"Harrison","year":"1978"},{"key":"10.1016\/0304-3975(84)90023-9_BIB6","series-title":"Introduction to Automata Theory, Languages and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0304-3975(84)90023-9_BIB7","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/S0022-0000(74)80052-8","article-title":"A geometric hierarchy of languages","volume":"8","author":"Khabbaz","year":"1974","journal-title":"J. Comput. System. Sci."},{"key":"10.1016\/0304-3975(84)90023-9_BIB8","unstructured":"R. Parchmann, Balanced context-free languages and indexed languages, Elektron. Informationsverarbeit. u. Kybernetik, to appear."},{"key":"10.1016\/0304-3975(84)90023-9_BIB9","series-title":"Formal Languages","author":"Salomaa","year":"1973"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397584900239?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397584900239?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T13:55:43Z","timestamp":1555077343000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397584900239"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984]]},"references-count":9,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1984]]}},"alternative-id":["0304397584900239"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(84)90023-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1984]]}}}