{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,2]],"date-time":"2024-01-02T01:10:18Z","timestamp":1704157818912},"reference-count":17,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1997,10,1]],"date-time":"1997-10-01T00:00:00Z","timestamp":875664000000},"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":5768,"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":[[1997,10]]},"DOI":"10.1016\/s0304-3975(97)86542-5","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T19:40:02Z","timestamp":1049744402000},"page":"157-169","source":"Crossref","is-referenced-by-count":10,"title":["A hierarchy of eNCE families of graph languages"],"prefix":"10.1016","volume":"186","author":[{"given":"Changwook","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(97)86542-5_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(97)86542-5_BIB2","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0166-218X(86)90070-3","article-title":"On the membership problem for regular DNLC grammars","volume":"13","author":"Aalbersberg","year":"1986","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(97)86542-5_BIB3","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\/S0304-3975(97)86542-5_BIB4","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(97)86542-5_BIB5","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(97)86542-5_BIB6","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(97)86542-5_BIB7","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(97)86542-5_BIB8","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(97)86542-5_BIB9","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/S0304-3975(97)86542-5_BIB10","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(97)86542-5_BIB11","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(97)86542-5_BIB12","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0304-3975(82)90088-3","article-title":"Graph grammars with neighborhood-controlled embedding","volume":"21","author":"Janssens","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(97)86542-5_BIB13","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":"Computer Graph. Image Process."},{"key":"10.1016\/S0304-3975(97)86542-5_BIB14","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(97)86542-5_BIB15","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0166-218X(87)90051-5","article-title":"String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing","volume":"16","author":"Lange","year":"1987","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(97)86542-5_BIB16","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/S0019-9958(86)80045-6","article-title":"Boundary NLC graph grammars \u2014 Basic definitions, normal forms, and complexity","volume":"69","author":"Rozenberg","year":"1986","journal-title":"Inform. and Control"},{"key":"10.1016\/S0304-3975(97)86542-5_BIB17","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."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597865425?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597865425?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,1,2]],"date-time":"2024-01-02T00:47:32Z","timestamp":1704156452000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397597865425"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,10]]},"references-count":17,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,10]]}},"alternative-id":["S0304397597865425"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)86542-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1997,10]]}}}