{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T10:55:03Z","timestamp":1770288903777,"version":"3.49.0"},"reference-count":27,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1999,7,1]],"date-time":"1999-07-01T00:00:00Z","timestamp":930787200000},"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":5130,"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":[[1999,7]]},"DOI":"10.1016\/s0304-3975(97)00190-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:48:18Z","timestamp":1027644498000},"page":"87-120","source":"Crossref","is-referenced-by-count":24,"title":["Independent parallelism in finite copying parallel rewriting systems"],"prefix":"10.1016","volume":"223","author":[{"given":"Owen","family":"Rambow","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giorgio","family":"Satta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0304-3975(97)00190-4_BIB1","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/S0022-0000(69)80006-1","article-title":"Syntax directed translations and the pushdown assembler","volume":"3","author":"Aho","year":"1969","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(97)00190-4_BIB2","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/S0019-9958(71)90706-6","article-title":"Translations on a context-free grammar","volume":"19","author":"Aho","year":"1971","journal-title":"Inform. Control"},{"key":"10.1016\/S0304-3975(97)00190-4_BIB3","volume":"vol. 1","author":"Aho","year":"1972"},{"key":"10.1016\/S0304-3975(97)00190-4_BIB4","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF01692060","article-title":"Graph expressions and graph rewritings","volume":"20","author":"Bauderon","year":"1987","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0304-3975(97)00190-4_BIB5","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1016\/0022-0000(86)90062-0","article-title":"Membership for growing context-sensitive grammars is polynomial","volume":"33","author":"Dahlhaus","year":"1986","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(97)00190-4_BIB6","series-title":"Regulated Rewriting in Formal Language Theory","author":"Dassow","year":"1989"},{"issue":"1","key":"10.1016\/S0304-3975(97)00190-4_BIB7","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1137\/0215005","article-title":"The complexity of languages generated by attribute grammars","volume":"15","author":"Engelfriet","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(97)00190-4_BIB8","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1016\/0022-0000(91)90018-Z","article-title":"The string generating power of context-free hypergraph grammars","volume":"43","author":"Engelfriet","year":"1991","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(97)00190-4_BIB9","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/0022-0000(80)90058-6","article-title":"Tree transducers, L systems, and two-way machines","volume":"20","author":"Engelfriet","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(97)00190-4_BIB10","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/S0022-0000(69)80015-2","article-title":"Scattered context grammars","volume":"3","author":"Greibach","year":"1969","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(97)00190-4_BIB11","series-title":"Proc. STACS","first-page":"207","article-title":"Some structural aspects of hypergraph languages generated by hyperedge replacement","volume":"vol. 247","author":"Habel","year":"1987"},{"key":"10.1016\/S0304-3975(97)00190-4_BIB12","series-title":"Introduction to Automata Theory, Languages and Computation","author":"Hopcroft","year":"1979"},{"issue":"1","key":"10.1016\/S0304-3975(97)00190-4_BIB13","first-page":"78","article-title":"The universal recognition problems for multiple context-free grammars and for linear context-free rewriting systems","volume":"E75-D","author":"Kaji","year":"1992","journal-title":"IEICE Trans. Inform. Systems"},{"key":"10.1016\/S0304-3975(97)00190-4_BIB14","author":"Kasami","year":"1987"},{"key":"10.1016\/S0304-3975(97)00190-4_BIB15","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1016\/S0019-9958(79)90641-7","article-title":"Substitutions dans les EDT0L-syst\u00e8mes ultralin\u00e9aires","volume":"42","author":"Latteux","year":"1979","journal-title":"Inform. Control"},{"key":"10.1016\/S0304-3975(97)00190-4_BIB16","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0019-9958(72)90287-2","article-title":"Some restrictive devices for context-free grammars","volume":"20","author":"Mayer","year":"1972","journal-title":"Inform. Control"},{"key":"10.1016\/S0304-3975(97)00190-4_BIB17","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0020-0190(71)90004-4","article-title":"A note on scattered context grammars","volume":"1","author":"Milgram","year":"1971","journal-title":"Inform. Processing Lett."},{"key":"10.1016\/S0304-3975(97)00190-4_BIB18","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/BF00985664","article-title":"Extension of tabled 0L-system and languages","volume":"2","author":"Rozenberg","year":"1973","journal-title":"Int. J. Comput. Inform. Sci."},{"key":"10.1016\/S0304-3975(97)00190-4_BIB19","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/S0019-9958(78)90050-5","article-title":"On ET0L systems of finite index","volume":"38","author":"Rozenberg","year":"1978","journal-title":"Inform. Control"},{"key":"10.1016\/S0304-3975(97)00190-4_BIB20","series-title":"Formal Languages","author":"Salomaa","year":"1973"},{"key":"10.1016\/S0304-3975(97)00190-4_BIB21","series-title":"30th Meeting of the Association for Computational Linguistics (ACL'92)","article-title":"Recognition of linear context-free rewriting systems","author":"Satta","year":"1992"},{"key":"10.1016\/S0304-3975(97)00190-4_BIB22","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0304-3975(91)90374-B","article-title":"On multiple context-free grammars","volume":"88","author":"Seki","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(97)00190-4_BIB23","series-title":"Currents in the Theory of Computing","first-page":"143","article-title":"Tree automata: an informal survey","author":"Thatcher","year":"1973"},{"key":"10.1016\/S0304-3975(97)00190-4_BIB24","series-title":"25th Meeting of the Association for Computational Linguistics (ACL'87)","article-title":"Characterizing structural descriptions produced by various grammatical formalisms","author":"Vijay-Shanker","year":"1987"},{"key":"10.1016\/S0304-3975(97)00190-4_BIB25","article-title":"Characterizing mildly context-sensitive grammar formalisms","author":"Weir","year":"1988"},{"key":"10.1016\/S0304-3975(97)00190-4_BIB26","series-title":"Proc. 30th Meeting of the Association for Computational Linguistics (ACL'92)","article-title":"Linear context-free rewriting systems and deterministic tree-walk transducers","author":"Weir","year":"1992"},{"key":"10.1016\/S0304-3975(97)00190-4_BIB27","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0019-9958(67)80007-X","article-title":"Recognition and parsing of context-free languages in time n3","volume":"10","author":"Younger","year":"1967","journal-title":"Inform. Control"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597001904?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597001904?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T13:21:34Z","timestamp":1555420894000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397597001904"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,7]]},"references-count":27,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1999,7]]}},"alternative-id":["S0304397597001904"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)00190-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1999,7]]}}}