{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:07Z","timestamp":1725663367351},"publisher-location":"Berlin, Heidelberg","reference-count":15,"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_44","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T14:49:03Z","timestamp":1330181343000},"page":"55-66","source":"Crossref","is-referenced-by-count":12,"title":["An introduction to the NLC way of rewriting graphs"],"prefix":"10.1007","author":[{"given":"G.","family":"Rozenberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Engelfriet, J., Leih, G., and Rozenberg, G., Apex graph grammars and attribute grammars, Dept. of Computer Science, University of Leiden, Techn. Report 87\u201304, 1987.","DOI":"10.1007\/3-540-18771-5_52"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/0304-3975(84)90135-X","volume":"31","author":"A. Ehrenfeucht","year":"1984","unstructured":"Ehrenfeucht, A., Main, M., and Rozenberg, G., Restrictions on NLC graph grammars, Theoretical Computer Science, v. 31, 211\u2013223, 1984.","journal-title":"Theoretical Computer Science"},{"key":"5_CR3","first-page":"179","volume":"4","author":"H.J. Genrich","year":"1984","unstructured":"Genrich, H.J., Janssens, D., Rozenberg G., and Thiagarajan, P.S., Generalized handle grammars and their relation to Petri nets, Journal of Information Processing and Cybernetics \u2014 EIK, v. 4, 179\u2013206, 1984.","journal-title":"Journal of Information Processing and Cybernetics \u2014 EIK"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0020-0255(80)90038-9","volume":"20","author":"D. Janssens","year":"1980","unstructured":"Janssens, D., and Rozenberg G., On the structure of node-label controlled graph languages, Information Sciences, v. 20, 191\u2013216, 1980.","journal-title":"Information Sciences"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0020-0255(80)90039-0","volume":"20","author":"D. Janssens","year":"1980","unstructured":"Janssens, D., and Rozenberg, G., Restrictions extensions and variations of NLC grammars, Information Sciences, v. 20, 217\u2013244, 1980.","journal-title":"Information Sciences"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/0022-0000(81)90025-8","volume":"22","author":"D. Jansens","year":"1981","unstructured":"Jansens, D., and Rozeberg G., Decision problems for node-label controlled graph grammars, Journal of Computer and System Sciences, v. 22, 144\u2013177, 1981.","journal-title":"Journal of Computer and System Sciences"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/BF00289591","volume":"16","author":"D. Janssens","year":"1981","unstructured":"Janssens, D., and Rozenberg, G., A characterization of context-free string languages by directed node-label controlled graph grammars, Acta Informatica, v. 16, 63\u201385, 1981.","journal-title":"Acta Informatica"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0304-3975(82)90088-3","volume":"21","author":"D. Janssens","year":"1982","unstructured":"Janssens, D., and Rozenberg, G., Graph grammars with neighbourhood controlled embedding, Theoretical Computer Science, v. 21, 55\u201374, 1982.","journal-title":"Theoretical Computer Science"},{"key":"5_CR9","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0734-189X(86)90023-X","volume":"35","author":"D. Janssens","year":"1986","unstructured":"Janssens, D., and Rozenberg, G., Neighbourhood-Uniform NLC Grammars, Computer Vision, Graphics, and Image Processing, v. 35, 131\u2013151, 1986.","journal-title":"Computer Vision, Graphics, and Image Processing"},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0146-664X(82)90036-3","volume":"18","author":"D. Janssens","year":"1982","unstructured":"Janssens, D., Rozenberg, G., and Verraedt, R., On sequential and parallel node-rewriting graph grammars, Computer Graphics and Image Processing, v. 18, 279\u2013304, 1982.","journal-title":"Computer Graphics and Image Processing"},{"key":"5_CR11","first-page":"307","volume":"7","author":"A. Rosenfeld","year":"1972","unstructured":"Rosenfeld, A., and Milgram, D.L., Web automata and web grammars, Machine Intelligence, v. 7, 307\u2013324, 1972.","journal-title":"Machine Intelligence"},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/S0019-9958(86)80045-6","volume":"69","author":"G. Rozenberg","year":"1986","unstructured":"Rozenberg, G., and Welzl, E., Boundary NLC graph grammars \u2014 basic definitions, normal forms, and complexity, Information and Control, v. 69, 136\u2013167, 1986.","journal-title":"Information and Control"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/BF00289115","volume":"23","author":"G. Rozenberg","year":"1986","unstructured":"Rozenberg, G., and Welzl, E., Graph theoretic closure properties of the family of boundary NLC languages, Acta Informatica, v. 23, 289\u2013309, 1986.","journal-title":"Acta Informatica"},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0166-218X(87)90054-0","volume":"16","author":"G. Rozenberg","year":"1987","unstructured":"Rozenberg, G., and Welzl, E., Combinatorial properties of boundary NLC graph languages, Discrete Applied Mathematics, v. 16, 59\u201373, 1987.","journal-title":"Discrete Applied Mathematics"},{"key":"5_CR15","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/978-3-642-95486-3_38","volume-title":"The Book of L","author":"E. Welzl","year":"1986","unstructured":"Welzl, E., On the set of all subgraphs of the graphs in a boundary NLC graph language, in The Book of L (Rozenberg, G., and Salomaa, A., eds.), Springer Verlag, Berlin, Heidelberg, 445\u2013459, 1986."}],"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_44.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:15:30Z","timestamp":1605626130000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-18771-5_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540187714","9783540481782"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-18771-5_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1987]]}}}