{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,2]],"date-time":"2024-01-02T15:40:23Z","timestamp":1704210023826},"reference-count":21,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1993,11,1]],"date-time":"1993-11-01T00:00:00Z","timestamp":752112000000},"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":7198,"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":[[1993,11]]},"DOI":"10.1016\/0304-3975(93)90290-a","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"247-259","source":"Crossref","is-referenced-by-count":5,"title":["Separating k-separated eNCE graph languages"],"prefix":"10.1016","volume":"120","author":[{"given":"Changwook","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dong Hoon","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(93)90290-A_BIB1","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\/0304-3975(93)90290-A_BIB2","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 grammars","volume":"55","author":"Courcelle","year":"1978","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(93)90290-A_BIB3","series-title":"Report 90-84","article-title":"Handle-rewriting hypergraph grammars","author":"Courcelle","year":"1990"},{"key":"10.1016\/0304-3975(93)90290-A_BIB4","series-title":"Graph Grammars and Their Applications to Computer Science","volume":"Vol. 532","year":"1991"},{"key":"10.1016\/0304-3975(93)90290-A_BIB5","series-title":"Graph Grammars and Their Application to Computer Science","volume":"Vol. 153","year":"1983"},{"key":"10.1016\/0304-3975(93)90290-A_BIB6","series-title":"Graph Grammars and Their Application to Computer Science","volume":"Vol. 291","year":"1987"},{"key":"10.1016\/0304-3975(93)90290-A_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 Comput."},{"key":"10.1016\/0304-3975(93)90290-A_BIB8","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\/0304-3975(93)90290-A_BIB9","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\/0304-3975(93)90290-A_BIB10","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\/0304-3975(93)90290-A_BIB11","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\/0304-3975(93)90290-A_BIB12","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\/0304-3975(93)90290-A_BIB13","article-title":"Some structural aspects of hypergraph languages generated by hyperedge replacement","volume":"Vol. 247","author":"Habel","year":"1987"},{"key":"10.1016\/0304-3975(93)90290-A_BIB14","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\/0304-3975(93)90290-A_BIB15","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\/0304-3975(93)90290-A_BIB16","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\/0304-3975(93)90290-A_BIB17","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\/0304-3975(93)90290-A_BIB18","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. Vision, Graphics, and Image Process."},{"key":"10.1016\/0304-3975(93)90290-A_BIB19","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\/0304-3975(93)90290-A_BIB20","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\/0304-3975(93)90290-A_BIB21","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."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390290A?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390290A?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,1,2]],"date-time":"2024-01-02T15:08:58Z","timestamp":1704208138000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759390290A"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,11]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,11]]}},"alternative-id":["030439759390290A"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(93)90290-a","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1993,11]]}}}