{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,7]],"date-time":"2025-08-07T08:51:19Z","timestamp":1754556679708},"reference-count":42,"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(99)00258-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:48:18Z","timestamp":1027644498000},"page":"143-178","source":"Crossref","is-referenced-by-count":5,"title":["HRNCE grammars \u2014 a hypergraph generating system with an eNCE way of rewriting"],"prefix":"10.1016","volume":"223","author":[{"given":"Changwook","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Tae Eui Jeong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00258-3_BIB1","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1016\/0022-0000(90)90004-5","article-title":"The complexity of regular DNLC graph languages","volume":"40","author":"Aalbersberg","year":"1990","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(99)00258-3_BIB2","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(99)00258-3_BIB3","series-title":"Proc. 1st Internat. Workshop on Graph Grammars and Their Application to Computer Science and Biology","volume":"vol. 73","year":"1979"},{"key":"10.1016\/S0304-3975(99)00258-3_BIB4","series-title":"Proc. 5th Internat. Workshop on Graph Grammars and their Application to Computer Science","volume":"vol. 1073","year":"1996"},{"key":"10.1016\/S0304-3975(99)00258-3_BIB5","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":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00258-3_BIB6","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/0022-0000(93)90004-G","article-title":"Handle-rewriting hypergraph grammars","volume":"46","author":"Courcelle","year":"1993","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(99)00258-3_BIB7","series-title":"Proc. 4th Internat. Workshop on Graph Grammars and their Application to Computer Science","volume":"vol. 532","year":"1991"},{"key":"10.1016\/S0304-3975(99)00258-3_BIB8","series-title":"Proc. 2nd Internat. Workshop on Graph Grammars and their Application to Computer Science","volume":"vol. 153","year":"1983"},{"key":"10.1016\/S0304-3975(99)00258-3_BIB9","series-title":"Proc. 3rd Internat. Workshop on Graph Grammars and Their Application to Computer Science","volume":"vol. 291","year":"1987"},{"key":"10.1016\/S0304-3975(99)00258-3_BIB10","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/S0022-0000(05)80022-4","article-title":"Hypergraph languages of bounded degree","volume":"48","author":"Engelfriet","year":"1994","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(99)00258-3_BIB11","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 Comput."},{"key":"10.1016\/S0304-3975(99)00258-3_BIB12","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1051\/ita\/1990240302671","article-title":"Complexity of boundary graph languages","volume":"24","author":"Engelfriet","year":"1990","journal-title":"Theoret. Inform. Appl."},{"key":"10.1016\/S0304-3975(99)00258-3_BIB13","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\/S0304-3975(99)00258-3_BIB14","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0304-3975(91)90174-Z","article-title":"Nonterminal separation in graph grammars","volume":"82","author":"Engelfriet","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00258-3_BIB15","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0022-0000(90)90002-3","article-title":"Boundary graph grammars with dynamic edge relabeling","volume":"40","author":"Engelfriet","year":"1990","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(99)00258-3_BIB16","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0890-5401(90)90038-J","article-title":"A comparison of boundary graph grammars and context-free hypergraph grammars","volume":"84","author":"Engelfriet","year":"1990","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(99)00258-3_BIB17","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0304-3975(99)00258-3_BIB18","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1016\/0196-6774(84)90006-3","article-title":"Improved dynamic programming algorithms for bandwidth minimization and the min cut linear arrangement problem","volume":"5","author":"Gurari","year":"1984","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(99)00258-3_BIB19","series-title":"Proc. STACS 87","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(99)00258-3_BIB20","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1007\/BF00288976","article-title":"Metatheorems for decision problems on hyperedge replacement graph languages","volume":"26","author":"Habel","year":"1989","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(99)00258-3_BIB21","series-title":"Introduction to Formal Language Theory","author":"Harrison","year":"1978"},{"key":"10.1016\/S0304-3975(99)00258-3_BIB22","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/S0304-3975(99)00258-3_BIB23","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\/S0304-3975(99)00258-3_BIB24","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\/S0304-3975(99)00258-3_BIB25","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/0022-0000(81)90025-8","article-title":"Decision problems for node label controlled graph grammars","volume":"22","author":"Janssens","year":"1981","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(99)00258-3_BIB26","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0304-3975(82)90088-3","article-title":"Graph grammars with neighbourhood-controlled embedding","volume":"21","author":"Janssens","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00258-3_BIB27","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0734-189X(86)90023-X","article-title":"Neighborhood-uniform NLC grammars","volume":"35","author":"Janssens","year":"1986","journal-title":"Comput. Vis. Graphics Image Process"},{"key":"10.1016\/S0304-3975(99)00258-3_BIB28","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/0196-6774(82)90026-8","article-title":"The NP-completeness column: an ongoing guide","volume":"3","author":"Johnson","year":"1982","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(99)00258-3_BIB29","article-title":"A catalog of complexity classes","volume":"vol. A","author":"Johnson","year":"1990"},{"key":"10.1016\/S0304-3975(99)00258-3_BIB30","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/S0304-3975(97)86542-5","article-title":"A hierarchy of eNCE families of graph languages","volume":"186","author":"Kim","year":"1997","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00258-3_BIB31","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0304-3975(93)90290-A","article-title":"Separating k-separated eNCE graph languages","volume":"120","author":"Kim","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00258-3_BIB32","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1006\/inco.1995.1029","article-title":"Node replacement graph languages squeezed with chains, trees, and forests","volume":"117","author":"Kim","year":"1995","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(99)00258-3_BIB33","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/BF00289017","article-title":"The complexity of graph languages generated by hyperedge replacement","volume":"27","author":"Lautemann","year":"1990","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(99)00258-3_BIB34","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1137\/0603010","article-title":"Upper and lower bounds on the complexity of the min-cut linear arrangement problem on trees","volume":"3","author":"Lengauer","year":"1982","journal-title":"SIAM J. Algebraic Discrete Meth."},{"key":"10.1016\/S0304-3975(99)00258-3_BIB35","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1016\/0022-0000(87)90012-2","article-title":"Handle NLC grammars and r.e. languages","volume":"35","author":"Main","year":"1987","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(99)00258-3_BIB36","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1016\/0022-0000(90)90012-A","article-title":"Edge-label controlled graph grammars","volume":"40","author":"Main","year":"1990","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(99)00258-3_BIB37","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. and Control"},{"key":"10.1016\/S0304-3975(99)00258-3_BIB38","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\/S0304-3975(99)00258-3_BIB39","doi-asserted-by":"crossref","first-page":"59","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\/S0304-3975(99)00258-3_BIB40","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1145\/321906.321913","article-title":"A note on tape-bounded complexity classes and linear context-free languages","volume":"22","author":"Sudborough","year":"1975","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(99)00258-3_BIB41","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1145\/322077.322083","article-title":"On the complexity of deterministic context-free languages","volume":"25","author":"Sudborough","year":"1978","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(99)00258-3_BIB42","first-page":"271","article-title":"On the complexity of graph grammars","volume":"6","author":"Tur\u00e1n","year":"1983","journal-title":"Acta Cybernet."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599002583?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599002583?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T23:40:42Z","timestamp":1704152442000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599002583"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,7]]},"references-count":42,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1999,7]]}},"alternative-id":["S0304397599002583"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00258-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1999,7]]}}}