{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:47Z","timestamp":1725663287106},"publisher-location":"Berlin, Heidelberg","reference-count":13,"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_52","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:47:34Z","timestamp":1330199254000},"page":"167-185","source":"Crossref","is-referenced-by-count":15,"title":["Apex graph grammars"],"prefix":"10.1007","author":[{"given":"Joost","family":"Engelfriet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George","family":"Leih","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Grzegorz","family":"Rozenberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-663-09367-1","volume-title":"Transductions and context-free languages","author":"J. Berstel","year":"1979","unstructured":"J. Berstel; \"Transductions and context-free languages\", Teubner, Stuttgart, 1979."},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"J.Engelfriet, G.Leih, G.Rozenberg; Apex graph grammars and attribute grammars; Report 87-04, Institute of Applied Math. and Computer Science, University of Leiden, March 1987.","DOI":"10.1007\/3-540-18771-5_52"},{"key":"13_CR3","volume-title":"Tree automata","author":"F. Gecseg","year":"1984","unstructured":"F. Gecseg, M. Steinby; \"Tree automata\", Akademiai Kiado, Budapest, 1984."},{"key":"13_CR4","first-page":"228","volume":"2","author":"S. Ginsburg","year":"1968","unstructured":"S. Ginsburg, E. Spanier; Derivation-bounded languages, JCSS 2 (1968), 228\u2013250.","journal-title":"JCSS"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1016\/0196-6774(84)90006-3","volume":"5","author":"E.M. Gurari","year":"1984","unstructured":"E.M. Gurari, I.H. Sudborough; Improved dynamic programming algorithms for bandwidth minimization and the min-cut linear arrangement problem, J. of Algorithms 5 (1984), 531\u2013546.","journal-title":"J. of Algorithms"},{"key":"13_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, G. Rozenberg; Restrictions, extensions, and variations of NLC grammars, Information Sciences 20 (1980), 217\u2013244.","journal-title":"Information Sciences"},{"key":"13_CR7","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, G. Rozenberg; Graph grammars with neighbourhood-controlled embedding, Theor.Comp.Science 21 (1982), 55\u201374.","journal-title":"Theor.Comp.Science"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0146-664X(82)90036-3","volume":"18","author":"D. Janssens","year":"1982","unstructured":"D. Janssens, G. Rozenberg, R. Verraedt; On sequential and parallel node-rewriting graph grammars, Computer Graphics and Image Processing 18 (1982), 279\u2013304.","journal-title":"Computer Graphics and Image Processing"},{"key":"13_CR9","unstructured":"M.Kaul; Syntaxanalyse von Graphen bei Pr\u00e4zedenz-Graph-Grammatiken, Dissertation, Universit\u00e4t Osnabr\u00fcck, 1985."},{"key":"13_CR10","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1137\/0603010","volume":"3","author":"T. Lengauer","year":"1982","unstructured":"T. Lengauer; Upper and lower bounds on the complexity of the min-cut linear arrangement problem on trees, SIAM J. Alg. Disc. Meth. 3 (1982), 99\u2013113.","journal-title":"SIAM J. Alg. Disc. Meth."},{"key":"13_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-663-01443-0","volume-title":"Graph-Grammatiken","author":"M. Nagl","year":"1979","unstructured":"M. Nagl; \"Graph-Grammatiken\", Vieweg, Braunschweig, 1979."},{"key":"13_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, E. Welzl; Boundary NLC graph grammars \u2014 basic definitions, normal forms, and complexity, Inform. Contr. 69 (1986), 136\u2013167.","journal-title":"Inform. Contr."},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1007\/3-540-13345-3_47","volume-title":"Proc. 11th ICALP","author":"E. Welzl","year":"1984","unstructured":"E. Welzl; Encoding graphs by derivations and implications for the theory of graph grammars, Proc. 11th ICALP, Lecture Notes in Computer Science 172, Springer-Verlag, Berlin, 1984, pp.503\u2013513."}],"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_52.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:15:32Z","timestamp":1605644132000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-18771-5_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540187714","9783540481782"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-18771-5_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1987]]}}}