{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T15:45:37Z","timestamp":1648827937439},"reference-count":16,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1990,4,1]],"date-time":"1990-04-01T00:00:00Z","timestamp":638928000000},"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":8508,"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,4]]},"DOI":"10.1016\/0022-0000(90)90012-a","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T07:01:00Z","timestamp":1070521260000},"page":"188-228","source":"Crossref","is-referenced-by-count":4,"title":["Edge-label controlled graph grammars"],"prefix":"10.1016","volume":"40","author":[{"given":"Michael G.","family":"Main","sequence":"first","affiliation":[]},{"given":"Grzegorz","family":"Rozenberg","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(90)90012-A_BIB1","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 it's applications to NLC grammars","volume":"55","author":"Courcelle","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(90)90012-A_BIB2","series-title":"Proceedings, Conf. Switch. Automata Theory","first-page":"167","article-title":"Graph grammars\u2014An algebraic approach","author":"Ehrig","year":"1973"},{"key":"10.1016\/0022-0000(90)90012-A_BIB3","series-title":"Graph-Grammars and Their Application to Computer Science, 2nd International Workshop","first-page":"143","article-title":"On context-free graph languages generated by edge replacement","volume":"Vol. 153","author":"Habel","year":"1983"},{"key":"10.1016\/0022-0000(90)90012-A_BIB4","series-title":"Technical Report","article-title":"Characteristics of Graph Langages Generated by Edge Replacement","author":"Habel","year":"1985"},{"key":"10.1016\/0022-0000(90)90012-A_BIB5","series-title":"Introduction to Formal Language Theory","author":"Harrison","year":"1978"},{"key":"10.1016\/0022-0000(90)90012-A_BIB6","article-title":"Results on NLC Grammars with One-letter Terminal Alphabets","author":"Hoffmann","year":"1986","journal-title":"University of Colorado Technical Report Cu-CS-348-86"},{"key":"10.1016\/0022-0000(90)90012-A_BIB7","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)90012-A_BIB8","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)90012-A_BIB9","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\/0022-0000(90)90012-A_BIB10","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\/0022-0000(90)90012-A_BIB11","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/S0019-9958(84)80044-3","article-title":"Direction independent contextsensitive grammars","volume":"63","author":"Kleijn","year":"1984","journal-title":"Inform. and Control"},{"key":"10.1016\/0022-0000(90)90012-A_BIB12","article-title":"Handle NLC Grammars and Languages","author":"Main","year":"1985","journal-title":"University of Colorado Technical Report CU-CS-315-85"},{"key":"10.1016\/0022-0000(90)90012-A_BIB13","series-title":"Graph-Grammars and Their Application to Computer Science and Biology","first-page":"70","article-title":"A tutorial and bibliographical survey on graph grammars","volume":"Vol. 73","author":"Nagl","year":"1978"},{"key":"10.1016\/0022-0000(90)90012-A_BIB14","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1137\/0214031","article-title":"An \u201cInterchange Lemma\u201d for context-free languages","volume":"14","author":"Ogden","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(90)90012-A_BIB15","first-page":"25","article-title":"Classes of recursively enumerable sets and their decision problems","volume":"89","author":"Rice","year":"1953","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0022-0000(90)90012-A_BIB16","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/S0019-9958(86)80045-6","article-title":"Boundary NLC graph grammars\u2014Basic definitions, normal forms, and complexity","volume":"69","author":"Rozenberg","year":"1986","journal-title":"Inform. and Control"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009090012A?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009090012A?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T08:55:33Z","timestamp":1550307333000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002200009090012A"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,4]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1990,4]]}},"alternative-id":["002200009090012A"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(90)90012-a","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1990,4]]}}}