{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T06:54:30Z","timestamp":1777100070227,"version":"3.51.4"},"reference-count":7,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,9,1]],"date-time":"2000-09-01T00:00:00Z","timestamp":967766400000},"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":4702,"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":[[2000,9]]},"DOI":"10.1016\/s0304-3975(00)00153-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T16:23:52Z","timestamp":1027614232000},"page":"279-284","source":"Crossref","is-referenced-by-count":17,"title":["Generative power of three-nonterminal scattered context grammars"],"prefix":"10.1016","volume":"246","author":[{"given":"Alexander","family":"Meduna","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00153-5_BIB1","series-title":"Regulated Rewriting in Formal Language Theory","author":"Dassow","year":"1989"},{"key":"10.1016\/S0304-3975(00)00153-5_BIB2","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/BF00264281","article-title":"On the generative power of regular pattern grammars","volume":"20","author":"Kleijn","year":"1983","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(00)00153-5_BIB3","first-page":"465","article-title":"Four-nonterminal scattered context grammars characterize the family of recursively enumerable languages","volume":"51","author":"Meduna","year":"1996","journal-title":"Int. J. Comput. Math."},{"key":"10.1016\/S0304-3975(00)00153-5_BIB4","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1016\/S0304-3975(99)00292-3","article-title":"Terminating left-hand sides of scattered context productions","volume":"237","author":"Meduna","year":"2000","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00153-5_BIB5","series-title":"Automata and Languages: Theory and Applications","author":"Meduna","year":"2000"},{"key":"10.1016\/S0304-3975(00)00153-5_BIB6","unstructured":"Proceedings of the International Workshop on Descriptional Complexity of Automata, Grammars and Related Structures, July 20\u201323, 1999, Ed. by J. Dassow and D. Wotschke, Otto-von-Guericke University, Magdeburg, Germany, 1999."},{"key":"10.1016\/S0304-3975(00)00153-5_BIB7","unstructured":"Proceedings of the Second Workshop on Descriptional Complexity of Automata, Grammars and Related Structures, July 27\u201329, 2000, London, Canada (in press)."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500001535?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500001535?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T03:20:47Z","timestamp":1556248847000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500001535"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,9]]},"references-count":7,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,9]]}},"alternative-id":["S0304397500001535"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00153-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,9]]}}}