{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:46:05Z","timestamp":1759063565161},"reference-count":13,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"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":3643,"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,9]]},"DOI":"10.1016\/s0304-3975(03)00322-0","type":"journal-article","created":{"date-parts":[[2003,6,9]],"date-time":"2003-06-09T17:49:52Z","timestamp":1055180992000},"page":"449-469","source":"Crossref","is-referenced-by-count":8,"title":["Forbidding ET0L grammars"],"prefix":"10.1016","volume":"306","author":[{"given":"Alexander","family":"Meduna","sequence":"first","affiliation":[]},{"given":"Martin","family":"\u0160vec","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(03)00322-0_BIB1","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1080\/00207169008803908","article-title":"Generalized Forbidding Grammars","volume":"36","author":"Meduna","year":"1990","journal-title":"Internat. J. Comput. Math."},{"key":"10.1016\/S0304-3975(03)00322-0_BIB2","series-title":"Automata and Languages: Theory and Applications","author":"Meduna","year":"2000"},{"key":"10.1016\/S0304-3975(03)00322-0_BIB3","first-page":"112","article-title":"Grammars with context conditions","volume":"32","author":"Meduna","year":"1993","journal-title":"EATCS Bull."},{"key":"10.1016\/S0304-3975(03)00322-0_BIB4","first-page":"353","article-title":"Reduction of simple semi-conditional grammars with respect to the number of conditional productions","volume":"15","author":"Meduna","year":"2002","journal-title":"Acta Cybernet."},{"issue":"1","key":"10.1016\/S0304-3975(03)00322-0_BIB5","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1080\/00207160304666","article-title":"Descriptional complexity of generalized forbidding grammars","volume":"80","author":"Meduna","year":"2003","journal-title":"Internat. J. Comput. Math."},{"key":"10.1016\/S0304-3975(03)00322-0_BIB6","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/S0019-9958(74)91049-3","article-title":"One-sided and two-sided context in formal grammars","volume":"25","author":"Penttonen","year":"1974","journal-title":"Inform. Control"},{"key":"10.1016\/S0304-3975(03)00322-0_BIB7","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0020-0190(75)90052-6","article-title":"ET0L-grammars and N-grammars","volume":"4","author":"Penttonen","year":"1975","journal-title":"Inform. Proc. Lett."},{"key":"10.1016\/S0304-3975(03)00322-0_BIB8","series-title":"The Mathematical Theory of L-Systems","author":"Rozenberg","year":"1980"},{"key":"10.1016\/S0304-3975(03)00322-0_BIB9","doi-asserted-by":"crossref","unstructured":"G. Rozenberg, A. Salomaa (Eds.), Handbook of Formal Languages, Vol. 1\u20133, Springer, Berlin, 1997.","DOI":"10.1007\/978-3-642-59126-6"},{"key":"10.1016\/S0304-3975(03)00322-0_BIB10","series-title":"Formal Languages","author":"Salomaa","year":"1973"},{"key":"10.1016\/S0304-3975(03)00322-0_BIB11","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1080\/00207168408803400","article-title":"Rewriting systems with limited distance forbidding context conditions","volume":"15","author":"von Solms","year":"1984","journal-title":"Internat. J. Comput. Math."},{"key":"10.1016\/S0304-3975(03)00322-0_BIB12","first-page":"341","article-title":"A note on conditional grammars","volume":"28","author":"Urbanek","year":"1983","journal-title":"Rev. Roum. Math. Pures. Appl."},{"key":"10.1016\/S0304-3975(03)00322-0_BIB13","first-page":"66","article-title":"Random context languages","volume":"71","author":"van der Walt","year":"1972","journal-title":"Inform. Process."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503003220?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503003220?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T17:31:11Z","timestamp":1553103071000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397503003220"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":13,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0304397503003220"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(03)00322-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}