{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:55:08Z","timestamp":1725663308819},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540187714"},{"type":"electronic","value":"9783540481782"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3-540-18771-5_67","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T14:48:21Z","timestamp":1330181301000},"page":"411-426","source":"Crossref","is-referenced-by-count":2,"title":["Fundamentals of edge-label controlled graph grammars"],"prefix":"10.1007","author":[{"given":"Michael G.","family":"Main","sequence":"first","affiliation":[]},{"given":"Grzegorz","family":"Rozenberg","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"H. Ehrig, M. Pfender and H.J. Schneider. Graph grammars \u2014 an algebraic approach, in: Proc. Conf. Switch. Automata Theory (1973), 167\u2013180.","DOI":"10.1109\/SWAT.1973.11"},{"key":"28_CR2","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/BFb0000104","volume-title":"Graph-Grammars and Their Application to Computer Science, 2nd International Workshop","author":"A. Habel","year":"1983","unstructured":"A. Habel and H.-J. Kreowski. On context-free graph languages generated by edge replacement, in: Graph-Grammars and Their Application to Computer Science, 2nd International Workshop, (H. Ehrig, M. Nagl and G. Rozenberg, eds), LNCS 153, Springer-Verlag, Berlin (1983), 143\u2013158."},{"key":"28_CR3","unstructured":"A. Habel and H.-J. Kreowski. Characteristics of graph langages generated by edge replacement, Technical Report, Department of Computer Science, University of Bremen (1985)."},{"key":"28_CR4","unstructured":"J. Hoffmann and M.G. Main. Results on NLC grammars with one-letter terminal alphabets, University of Colorado Technical Report Cu-CS-348-86 (September 1986)."},{"key":"28_CR5","doi-asserted-by":"publisher","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, Information Sciences 20 (1980), 191\u2013216.","journal-title":"Information Sciences"},{"key":"28_CR6","doi-asserted-by":"publisher","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, Information Sciences 20 (1980), 217\u2013244.","journal-title":"Information Sciences"},{"key":"28_CR7","first-page":"144","volume":"22","author":"D. Janssens","year":"1981","unstructured":"D. Janssens and G. Rozenberg. Decision problems for node-label controlled graph grammars, JCSS 22 (1981), 144\u2013177.","journal-title":"JCSS"},{"key":"28_CR8","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0304-3975(82)90088-3","volume":"21","author":"D. Janssens","year":"1982","unstructured":"D. Janssens and G. Rozenberg. Graph grammars with neighbourhood controlled embedding, TCS 21 (1982), 55\u201374.","journal-title":"TCS"},{"key":"28_CR9","unstructured":"M.G. Main and G. Rozenberg. Handle NLC grammars and languages, University of Colorado Technical Report CU-CS-315-85 (1985), Journal of Computer and System Sciences, to appear."},{"key":"28_CR10","unstructured":"M.G. Main and G. Rozenberg. Edge-Label controlled graph grammars, University of Colorado Technical Report CU-CS-349-86 (1986), Paper presented at the 1986 Workshop on Graph Grammars and their Applications (University of Maryland)."},{"key":"28_CR11","first-page":"70","volume-title":"Graph-Grammars and Their Application to Computer Science and Biology","author":"M. Nagl","year":"1978","unstructured":"M. Nagl. A tutorial and bibliographical survey on graph grammars, in: Graph-Grammars and Their Application to Computer Science and Biology (V. Claus, H. Ehrig and G. Rozenberg, eds), LNCS 73, Springer-Verlag, Berlin (1978), 70\u2013126."},{"key":"28_CR12","doi-asserted-by":"publisher","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, Information and Control 69 (1986), 136\u2013167.","journal-title":"Information and Control"}],"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-18771-5_67.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T17:18:15Z","timestamp":1619543895000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-18771-5_67"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540187714","9783540481782"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-18771-5_67","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1987]]}}}