{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T04:47:56Z","timestamp":1768279676887,"version":"3.49.0"},"reference-count":36,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1990,6,1]],"date-time":"1990-06-01T00:00:00Z","timestamp":644198400000},"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":8447,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1990,6]]},"DOI":"10.1016\/0022-0000(90)90002-3","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"307-345","source":"Crossref","is-referenced-by-count":31,"title":["Boundary graph grammars with dynamic edge relabeling"],"prefix":"10.1016","volume":"40","author":[{"given":"Joost","family":"Engelfriet","sequence":"first","affiliation":[]},{"given":"George","family":"Leih","sequence":"additional","affiliation":[]},{"given":"Emo","family":"Welzl","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(90)90002-3_BIB1","series-title":"Transductions and Context-free Languages","author":"Berstel","year":"1979"},{"key":"10.1016\/0022-0000(90)90002-3_BIB2","doi-asserted-by":"crossref","unstructured":"F. J. Brandenburg, On partially ordered graph-grammars, in [EhrNagRozRos], pp. 99\u2013111.","DOI":"10.1007\/3-540-18771-5_48"},{"key":"10.1016\/0022-0000(90)90002-3_BIB3","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0304-3975(87)90102-2","article-title":"An axiomatic definition of context-free rewriting and its application to NLC graph grammars","volume":"55","author":"Courcelle","year":"1988","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(90)90002-3_BIB4","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0304-3975(84)90135-X","article-title":"Restrictions on NLC graph grammars","volume":"31","author":"Ehrenfeucht","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(90)90002-3_BIB5","series-title":"Graph-Grammars and Their Application to Computer Science","volume":"Vol. 153","year":"1983"},{"key":"10.1016\/0022-0000(90)90002-3_BIB6","series-title":"GraphGrammars and Their Application to Computer Science","volume":"Vol. 291","year":"1987"},{"key":"10.1016\/0022-0000(90)90002-3_BIB7","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/0890-5401(89)90030-8","article-title":"Linear Graph Grammars: Power and Complexity","volume":"81","author":"Engelfriet","year":"1989","journal-title":"Inform. and Computation"},{"key":"10.1016\/0022-0000(90)90002-3_BIB8","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0304-3975(88)90148-X","article-title":"Nonterminal bounded NLC graph grammars","volume":"59","author":"Engelfriet","year":"1988","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(90)90002-3_BIB9","article-title":"Complexity of Boundary Graph Languages","author":"Engelfriet","year":"1988","journal-title":"Report 88-07, Leiden"},{"key":"10.1016\/0022-0000(90)90002-3_BIB10","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1007\/BF00279953","article-title":"Apex graph grammars and attribute grammars","volume":"25","author":"Engelfriet","year":"1988","journal-title":"Acta Inform."},{"key":"10.1016\/0022-0000(90)90002-3_BIB11","doi-asserted-by":"crossref","unstructured":"J. Engelfriet, G. Leih, and G. Rozenberg, Apex graph grammars, in [EhrNagRozRos], pp. 167\u2013185","DOI":"10.1007\/3-540-18771-5_52"},{"key":"10.1016\/0022-0000(90)90002-3_BIB12","article-title":"Boundary Graph Grammars with Dynamic Edge Relabeling","author":"Engelfriet","year":"1987","journal-title":"Report 87-30"},{"key":"10.1016\/0022-0000(90)90002-3_BIB13","article-title":"A Comparison of Boundary Graph Grammars and Context-free Hypergraph Grammars","author":"Engelfriet","year":"1988","journal-title":"Report 88-06"},{"key":"10.1016\/0022-0000(90)90002-3_BIB14","series-title":"Tree Automata","author":"G\u00e9cseg","year":"1984"},{"key":"10.1016\/0022-0000(90)90002-3_BIB15","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0304-3975(87)90050-8","article-title":"Characteristics of graph languages generated by edge replacement","volume":"51","author":"Habel","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(90)90002-3_BIB16","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0022-0000(90)90002-3_BIB17","article-title":"Results on NLC Grammars with One-Letter Terminal Alphabets","author":"Hoffmann","year":"1986","journal-title":"Report CU-CS-348-86"},{"key":"10.1016\/0022-0000(90)90002-3_BIB18","article-title":"Node Label Controlled Graph Grammars","author":"Janssens","year":"1983"},{"key":"10.1016\/0022-0000(90)90002-3_BIB19","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0020-0255(80)90038-9","article-title":"On the structure of node-label-controlled graph languages","volume":"20","author":"Janssens","year":"1980","journal-title":"Inform. Sci."},{"key":"10.1016\/0022-0000(90)90002-3_BIB20","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0020-0255(80)90039-0","article-title":"Restrictions, extensions, and variations of NLC grammars","volume":"20","author":"Janssens","year":"1980","journal-title":"Inform. Sci."},{"key":"10.1016\/0022-0000(90)90002-3_BIB21","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF00289591","article-title":"A characterization of context-free string languages by directed node-label controlled graph grammars","volume":"16","author":"Janssens","year":"1981","journal-title":"Acta Inform."},{"key":"10.1016\/0022-0000(90)90002-3_BIB22","doi-asserted-by":"crossref","unstructured":"D. Janssens G. Rozenberg Graph grammars with node-label controlled rewriting and embedding, in [EhrNagRoz], 186\u2013205.","DOI":"10.1007\/BFb0000107"},{"key":"10.1016\/0022-0000(90)90002-3_BIB23","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0304-3975(82)90088-3","article-title":"Graph gramars with neighbourhood-controlled embedding","volume":"21","author":"Janssens","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(90)90002-3_BIB24","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0146-664X(82)90036-3","article-title":"On sequential and parallel node-rewriting graph grammars","volume":"18","author":"Janssens","year":"1982","journal-title":"Comput. Graphics Image Process."},{"key":"10.1016\/0022-0000(90)90002-3_BIB25","doi-asserted-by":"crossref","unstructured":"J. Jeffs Embedding rule independent theory of graph grammars, in [EhrNagRozRos], pp. 299\u2013308.","DOI":"10.1007\/3-540-18771-5_60"},{"key":"10.1016\/0022-0000(90)90002-3_BIB26","article-title":"Syntaxanalyse von Graphen bei Prdzedenz-Graph-Grammatiken","author":"Kaul","year":"1985"},{"key":"10.1016\/0022-0000(90)90002-3_BIB27","doi-asserted-by":"crossref","unstructured":"M. Kaul, Practical applications of precedence graph grammars, in [EhrNagRozRos], pp. 326\u2013342","DOI":"10.1007\/3-540-18771-5_62"},{"key":"10.1016\/0022-0000(90)90002-3_BIB28","series-title":"Graph-grammatiken","author":"Nagl","year":"1979"},{"key":"10.1016\/0022-0000(90)90002-3_BIB29","first-page":"307","article-title":"Web automata and web grammars","volume":"7","author":"Rosenfeld","year":"1972","journal-title":"Mach. Intell."},{"key":"10.1016\/0022-0000(90)90002-3_BIB30","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/S0019-9958(86)80045-6","article-title":"Boundary NLC graph grammars-Basic definitions, normal forms, and complexity","volume":"69","author":"Rozenberg","year":"1986","journal-title":"Inform. Control"},{"key":"10.1016\/0022-0000(90)90002-3_BIB31","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/BF00289115","article-title":"Graph theoretic closure properties of the family of boundary NLC graph languages","volume":"23","author":"Rozenberg","year":"1986","journal-title":"Acta Inform."},{"key":"10.1016\/0022-0000(90)90002-3_BIB32","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/0166-218X(87)90054-0","article-title":"Combinatorial properties of boundary NLC graph languages","volume":"16","author":"Rozenberg","year":"1987","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0022-0000(90)90002-3_BIB33","series-title":"Formal Languages","author":"Salomaa","year":"1973"},{"key":"10.1016\/0022-0000(90)90002-3_BIB34","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/S0022-0000(67)80022-9","article-title":"Characterizing derivation trees of context-free grammars through a generalization of finite automata theory","volume":"1","author":"Thatcher","year":"1967","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(90)90002-3_BIB35","series-title":"Proceedings, 11th ICALP","first-page":"503","article-title":"Encoding graphs by derivations and implications for the theory of graph grammars","volume":"Vol. 172","author":"Welzl","year":"1984"},{"key":"10.1016\/0022-0000(90)90002-3_BIB36","doi-asserted-by":"crossref","unstructured":"E. Welzl, Boundary NLC and partition controlled graph grammars,in [EhrNagRozRos], pp. 593\u2013609.","DOI":"10.1007\/3-540-18771-5_78"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000090900023?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000090900023?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T15:46:33Z","timestamp":1704987993000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000090900023"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,6]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1990,6]]}},"alternative-id":["0022000090900023"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(90)90002-3","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1990,6]]}}}