{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T13:45:45Z","timestamp":1772372745783,"version":"3.50.1"},"reference-count":23,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3827,"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":[[2003,3]]},"DOI":"10.1016\/s0304-3975(02)00656-4","type":"journal-article","created":{"date-parts":[[2003,2,17]],"date-time":"2003-02-17T16:25:27Z","timestamp":1045499127000},"page":"225-251","source":"Crossref","is-referenced-by-count":22,"title":["Nonterminal complexity of programmed grammars"],"prefix":"10.1016","volume":"296","author":[{"given":"Henning","family":"Fernau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(02)00656-4_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/00207169408804310","article-title":"Accepting grammars with regulation","volume":"53","author":"Bordihn","year":"1994","journal-title":"Internat. J. Comput. Math."},{"key":"10.1016\/S0304-3975(02)00656-4_BIB2","unstructured":"H. Bordihn, H. Fernau, M. Holzer, Accepting pure grammars, Publicationes Mathematicae, Debrecen, Vol. 60 Supplement (2002), pp. 483\u2013510."},{"key":"10.1016\/S0304-3975(02)00656-4_BIB3","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1142\/S012905419900006X","article-title":"On the leftmost derivation in matrix grammars","volume":"10","author":"Dassow","year":"1999","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00656-4_BIB4","article-title":"Regulated rewriting in formal language theory","volume":"Vol. 18","author":"Dassow","year":"1989"},{"key":"10.1016\/S0304-3975(02)00656-4_BIB5","doi-asserted-by":"crossref","first-page":"837","DOI":"10.1007\/s002360050108","article-title":"Unconditional transfer in regulated rewriting","volume":"34","author":"Fernau","year":"1997","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(02)00656-4_BIB6","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1023\/A:1009954606346","article-title":"On regulated grammars under leftmost derivation","volume":"3","author":"Fernau","year":"2000","journal-title":"GRAMMARS"},{"key":"10.1016\/S0304-3975(02)00656-4_BIB7","first-page":"202","article-title":"Nonterminal complexity of programmed grammars","volume":"Vol. 2055","author":"Fernau","year":"2001"},{"key":"10.1016\/S0304-3975(02)00656-4_BIB8","first-page":"95","article-title":"Accepting array grammars with control mechanisms","volume":"Vol. 1218","author":"Fernau","year":"1997"},{"issue":"2","key":"10.1016\/S0304-3975(02)00656-4_BIB9","first-page":"117","article-title":"Characterizations of recursively enumerable languages by programmed grammars with unconditional transfer","volume":"4","author":"Fernau","year":"1999","journal-title":"J. Automata Languages Combin."},{"key":"10.1016\/S0304-3975(02)00656-4_BIB10","first-page":"214","article-title":"On the number of non-terminal symbols in graph-controlled, programmed and matrix grammars","volume":"Vol. 2055","author":"Freund","year":"2001"},{"key":"10.1016\/S0304-3975(02)00656-4_BIB11","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0304-3975(78)90020-8","article-title":"Remarks on blind and partially blind one-way multicounter machines","volume":"7","author":"Greibach","year":"1978","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00656-4_BIB12","doi-asserted-by":"crossref","first-page":"719","DOI":"10.1007\/BF01178731","article-title":"Petri net algorithms in the theory of matrix grammars","volume":"31","author":"Hauschildt","year":"1994","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(02)00656-4_BIB13","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/S0304-3975(02)00656-4_BIB14","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1016\/S0022-0000(70)80045-9","article-title":"A hierarchy between context-free and context-sensitive languages","volume":"4","author":"Kasai","year":"1970","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(02)00656-4_BIB15","volume":"Vol. 2055","year":"2001"},{"key":"10.1016\/S0304-3975(02)00656-4_BIB16","first-page":"82","article-title":"Computing with membranes (P systems): universality results","volume":"Vol. 2055","author":"Mart\u0131́n-Vide","year":"2001"},{"key":"10.1016\/S0304-3975(02)00656-4_BIB17","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BF01178263","article-title":"Syntactic complexity of scattered context grammars","volume":"32","author":"Meduna","year":"1995","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(02)00656-4_BIB18","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1080\/00207169708804552","article-title":"Four-nonterminal scattered context grammars characterize the family of recursively enumerable languages","volume":"63","author":"Meduna","year":"1997","journal-title":"Internat. J. Comput. Math."},{"key":"10.1016\/S0304-3975(02)00656-4_BIB19","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/S0304-3975(00)00153-5","article-title":"Generative power of three-nonterminal scattered context grammars","volume":"246","author":"Meduna","year":"2000","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00656-4_BIB20","first-page":"237","article-title":"On state grammars","volume":"8","author":"Meduna","year":"1988","journal-title":"Acta Cybernet."},{"key":"10.1016\/S0304-3975(02)00656-4_BIB21","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1080\/00207168408803399","article-title":"Six nonterminals are enough for generating each r.e. language by a matrix grammar","volume":"15","author":"P\u0103un","year":"1984","journal-title":"Internat. J. Comput. Math."},{"issue":"1","key":"10.1016\/S0304-3975(02)00656-4_BIB22","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1145\/321495.321504","article-title":"Programmed grammars and classes of formal languages","volume":"16","author":"Rosenkrantz","year":"1969","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(02)00656-4_BIB23","series-title":"Automata Studies","first-page":"157","article-title":"A universal Turing machine with two internal states","author":"Shannon","year":"1956"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502006564?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502006564?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T00:27:13Z","timestamp":1553905633000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502006564"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["S0304397502006564"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00656-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}