{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T14:45:39Z","timestamp":1747579539287},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540612285"},{"type":"electronic","value":"9783540683889"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61228-9_100","type":"book-chapter","created":{"date-parts":[[2006,7,17]],"date-time":"2006-07-17T10:17:05Z","timestamp":1153131425000},"page":"383-396","source":"Crossref","is-referenced-by-count":3,"title":["HRNCE grammars \u2014 A hypergraph generating system with an eNCE way of rewriting"],"prefix":"10.1007","author":[{"given":"Changwook","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tae Eui","family":"Jeong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,9,7]]},"reference":[{"key":"26_CR1","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1016\/0022-0000(90)90004-5","volume":"40","author":"I. J. Aalbersberg","year":"1990","unstructured":"IJ. J. Aalbersberg, J. Engelfriet and G. Rozenberg, The complexity of regular DNLC graph languages, J. Comput. System Sci.\n40 (1990), 376\u2013404.","journal-title":"J. Comput. System Sci."},{"key":"26_CR2","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF01692060","volume":"20","author":"M. Bauderon","year":"1987","unstructured":"M. Bauderon and B. Courcelle, Graph expressions and graph rewritings, Math. Systems Theory 20 (1987), 83\u2013127.","journal-title":"Math. Systems Theory"},{"key":"26_CR3","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0304-3975(87)90102-2","volume":"55","author":"B. Courcelle","year":"1987","unstructured":"B. Courcelle, An axiomatic definition of context-free rewriting and its application to NLC graph grammars, Theoret. Comput. Sci.\n55 (1987), 141\u2013181.","journal-title":"Theoret. Comput. Sci."},{"key":"26_CR4","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/0022-0000(93)90004-G","volume":"46","author":"B. Courcelle","year":"1993","unstructured":"B. Courcelle, J. Engelfriet and G. Rozenberg, Handle-rewriting hypergraph grammars, J. Comput. System Sci.\n46 (1993), 218\u2013270.","journal-title":"J. Comput. System Sci."},{"key":"26_CR5","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/S0022-0000(05)80022-4","volume":"48","author":"J. Engelfriet","year":"1994","unstructured":"J. Engelfriet and L. Heyker, Hypergraph languages of bounded degree, J. Comput. System Sci.\n48 (1994), 58\u201389.","journal-title":"J. Comput. System Sci."},{"key":"26_CR6","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/0890-5401(89)90030-8","volume":"81","author":"J. Engelfriet","year":"1989","unstructured":"J. Engelfriet and G. Leih, Linear graph grammars: power and complexity, Inform. and Comput.\n81 (1989), 88\u2013121.","journal-title":"Inform. and Comput."},{"key":"26_CR7","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1051\/ita\/1990240302671","volume":"24","author":"J. Engelfriet","year":"1990","unstructured":"J. Engelfriet and G. Leih, Complexity of boundary graph languages, Theoretical Informatics and Applications\n24 (1990), 267\u2013274.","journal-title":"Theoretical Informatics and Applications"},{"key":"26_CR8","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0022-0000(90)90002-3","volume":"40","author":"J. Engelfriet","year":"1990","unstructured":"J. Engelfriet, G. Leih and E. Welzl, Boundary graph grammars with dynamic edge relabeling, J. Comput. System Sci.\n40 (1990), 307\u2013345.","journal-title":"J. Comput. System Sci."},{"key":"26_CR9","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0890-5401(90)90038-J","volume":"84","author":"J. Engelfriet","year":"1990","unstructured":"J. Engelfriet and G. Rozenberg, A comparison of boundary graph grammars and context-free hypergraph grammars, Inform. and Comput.\n84 (1990), 163\u2013206.","journal-title":"Inform. and Comput."},{"key":"26_CR10","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BFb0039608","volume":"247","author":"A. Habel","year":"1987","unstructured":"A. Habel and H.-J. Kreowski, Some structural aspects of hypergraph languages generated by hyperedge replacement, Proc. STACS 87, Lecture Notes in Computer Science 247 (1987), 207\u2013219.","journal-title":"Lecture Notes in Computer Science"},{"key":"26_CR11","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0020-0255(80)90038-9","volume":"20","author":"D. Janssens","year":"1980","unstructured":"D. Janssens and G. Rozenberg, On the structure of node-label-controlled graph languages, Inform. Sci.\n20 (1980), 191\u2013216.","journal-title":"Inform. Sci."},{"key":"26_CR12","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0020-0255(80)90039-0","volume":"20","author":"D. Janssens","year":"1980","unstructured":"D. Janssens and G. Rozenberg, Restrictions, extensions, and variations of NLC grammars, Inform. Sci.\n20 (1980), 217\u2013244.","journal-title":"Inform. Sci."},{"key":"26_CR13","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/BF00289017","volume":"27","author":"C. Lautemann","year":"1990","unstructured":"C. Lautemann, The complexity of graph languages generated by hyperedge replacement, Acta Inform.\n27 (1990), 399\u2013421.","journal-title":"Acta Inform."},{"key":"26_CR14","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/S0019-9958(86)80045-6","volume":"69","author":"G. Rozenberg","year":"1986","unstructured":"G. Rozenberg and E. Welzl, Boundary NLC graph grammars \u2014 Basic definitions, normal forms, and complexity, Inform. and Control\n69 (1986), 136\u2013167.","journal-title":"Inform. and Control"},{"key":"26_CR15","first-page":"271","volume":"6","author":"G. Tur\u00e1n","year":"1983","unstructured":"Gy. Tur\u00e1n, On the complexity of graph grammars, Acta Cybernet.\n6 (1983), 271\u2013280.","journal-title":"Acta Cybernet."}],"container-title":["Lecture Notes in Computer Science","Graph Grammars and Their Application to Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61228-9_100","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,6]],"date-time":"2019-02-06T06:41:52Z","timestamp":1549435312000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61228-9_100"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540612285","9783540683889"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-61228-9_100","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}