{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,10]],"date-time":"2025-04-10T09:50:52Z","timestamp":1744278652951},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540612285"},{"type":"electronic","value":"9783540683889"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61228-9_99","type":"book-chapter","created":{"date-parts":[[2006,7,17]],"date-time":"2006-07-17T14:17:05Z","timestamp":1153145825000},"page":"368-382","source":"Crossref","is-referenced-by-count":1,"title":["Concatenation of graphs"],"prefix":"10.1007","author":[{"given":"Joost","family":"Engelfriet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan Joris","family":"Vereijken","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,9,7]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF01692060","volume":"20","author":"M. Bauderon","year":"1987","unstructured":"M.Bauderon, B.Courcelle; Graph expressions and graph rewritings, Math. Syst. Theory 20 (1987), 83\u2013127","journal-title":"Math. Syst. Theory"},{"key":"25_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(75)90208-9","volume":"28","author":"D.B. Benson","year":"1975","unstructured":"D.B.Benson; The basic algebraic structures in categories of derivations, Inf. and Control 28 (1975), 1\u201329","journal-title":"Inf. and Control"},{"key":"25_CR3","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":"25_CR4","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1006\/inco.1995.1043","volume":"117","author":"F. Bossut","year":"1995","unstructured":"F.Bossut, M.Dauchet, B.Warin; A Kleene theorem for a class of planar acyclic graphs, Inf. and Comp. 117 (1995), 251\u2013265","journal-title":"Inf. and Comp."},{"key":"25_CR5","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1007\/BF00264292","volume":"1","author":"V. Claus","year":"1971","unstructured":"V.Claus; Ein Vollst\u00e4ndigkeitssatz f\u00fcr Programme und Schaltkreise, Acta Informatica 1 (1971), 64\u201378","journal-title":"Acta Informatica"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"B.Courcelle; Graph rewriting: an algebraic and logic approach, in Handbook of Theoretical Computer Science, Vol.B (J.van Leeuwen, ed.), Elsevier, 1990, pp.193\u2013242","DOI":"10.1016\/B978-0-444-88074-1.50010-X"},{"key":"25_CR7","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/0022-0000(93)90004-G","volume":"46","author":"B. Courcelle","year":"1993","unstructured":"B.Courcelle, J.Engelfriet, G.Rozenberg; Handle-rewriting hypergraph languages, J. of Comp. Syst. Sci. 46 (1993), 218\u2013270","journal-title":"J. of Comp. Syst. Sci."},{"key":"25_CR8","unstructured":"F.Drewes; Transducibility \u2014 symbolic computation by tree-transductions, University of Bremen, Bericht Nr. 2\/93, 1993"},{"key":"25_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-96644-5","volume-title":"Universal Theory of Automata","author":"H. Ehrig","year":"1974","unstructured":"H. Ehrig, K.-D. Kiermeier, H.-J. Kreowski, W. K\u00fchnel; Universal Theory of Automata, Teubner, Stuttgart, 1974"},{"key":"25_CR10","first-page":"15","volume-title":"Lecture Notes in Computer Science 787","author":"J. Engelfriet","year":"1994","unstructured":"J.Engelfriet; Graph grammars and tree transducers, Proc. CAAP'94 (S.Tison, ed.), Lecture Notes in Computer Science 787, Springer-Verlag, Berlin, 1994, pp.15\u201336"},{"key":"25_CR11","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1016\/0022-0000(91)90018-Z","volume":"43","author":"J. Engelfriet","year":"1991","unstructured":"J.Engelfriet, L.M.Heyker; The string generating power of context-free hypergraph grammars, J. of Comp. Syst. Sci. 43 (1991), 328\u2013360","journal-title":"J. of Comp. Syst. Sci."},{"key":"25_CR12","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/BF01178511","volume":"31","author":"J. Engelfriet","year":"1994","unstructured":"J.Engelfriet, L.M.Heyker, G.Leih; Context-free graph languages of bounded degree are generated by apex graph grammars, Acta Informatica 31 (1994), 341\u2013378","journal-title":"Acta Informatica"},{"key":"25_CR13","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/0022-0000(80)90058-6","volume":"20","author":"J. Engelfriet","year":"1980","unstructured":"J.Engelfriet, G.Rozenberg, G.Slutzki; Tree transducers, L systems, and two-way machines, J. of Comp. Syst. Sci. 20 (1980), 150\u2013202","journal-title":"J. of Comp. Syst. Sci."},{"key":"25_CR14","unstructured":"J.Engelfriet, J.J.Vereijken; Context-free graph grammars and concatenation of graphs, Report 95-27, Leiden University, September 1995"},{"key":"25_CR15","volume-title":"Tree Automata","author":"F. G\u00e9cseg","year":"1984","unstructured":"F.G\u00e9cseg, M.Steinby; Tree Automata, Akad\u00e9miai Kiad\u00f3, Budapest, 1984"},{"key":"25_CR16","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0304-3975(78)90035-X","volume":"6","author":"S. Greibach","year":"1978","unstructured":"S.Greibach; One-way finite visit automata, Theor. Comput. Sci. 6 (1978), 175\u2013221","journal-title":"Theor. Comput. Sci."},{"key":"25_CR17","volume-title":"Lecture Notes in Computer Science 643","author":"A. Habel","year":"1992","unstructured":"A.Habel; Hyperedge Replacement: Grammars and Languages, Lecture Notes in Computer Science 643, Springer-Verlag, Berlin, 1992"},{"key":"25_CR18","first-page":"185","volume":"1","author":"G. Hotz","year":"1965","unstructured":"G.Hotz; Eine Algebraisierung des Syntheseproblems von Schaltkreisen, EIK 1 (1965), 185\u2013205, 209\u2013231","journal-title":"EIK"},{"key":"25_CR19","first-page":"235","volume":"2","author":"G. Hotz","year":"1966","unstructured":"G.Hotz; Eindeutigkeit und Mehrdeutigkeit formaler Sprachen, EIK 2 (1966), 235\u2013246","journal-title":"EIK"},{"key":"25_CR20","series-title":"Lecture Notes in Computer Science 291","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1007\/3-540-18771-5_57","volume-title":"Graph-Grammars and Their Application to Computer Science","author":"G. Hotz","year":"1987","unstructured":"G.Hotz, R.Kolla, P.Molitor; On network algebras and recursive equations, in Graph-Grammars and Their Application to Computer Science (H.Ehrig, M.Nagl, G.Rozenberg, A.Rosenfeld, eds.), Lecture Notes in Computer Science 291, Springer-Verlag, Berlin, 1987, pp.250\u2013261"},{"key":"25_CR21","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1016\/S0022-0000(72)80025-4","volume":"6","author":"V. Rajlich","year":"1972","unstructured":"V.Rajlich; Absolutely parallel grammars and two-way finite state transducers, J. of Comp. Syst. Sci. 6 (1972), 324\u2013342","journal-title":"J. of Comp. Syst. Sci."},{"key":"25_CR22","volume-title":"Formal Languages","author":"A. Salomaa","year":"1973","unstructured":"A.Salomaa; Formal Languages, Academic Press, New York, 1973"}],"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-61228-9_99","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,6]],"date-time":"2019-02-06T12:22:06Z","timestamp":1549455726000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61228-9_99"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540612285","9783540683889"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-61228-9_99","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}