{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:24Z","timestamp":1761611184824},"publisher-location":"Berlin, Heidelberg","reference-count":13,"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_77","type":"book-chapter","created":{"date-parts":[[2006,7,17]],"date-time":"2006-07-17T10:17:05Z","timestamp":1153131425000},"page":"27-37","source":"Crossref","is-referenced-by-count":6,"title":["A category-theoretical approach to vertex replacement: The generation of infinite graphs"],"prefix":"10.1007","author":[{"given":"Michel","family":"Bauderon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,9,7]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0304-3975(91)90222-N","volume":"82","author":"M. Bauderon","year":"1991","unstructured":"M. Bauderon, Infinite Hypergraphs I. Basic properties, Theor. Comput. Sci. 82 (1991) 177\u2013214","journal-title":"Theor. Comput. Sci."},{"key":"3_CR2","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0304-3975(92)90011-4","volume":"103","author":"M. Bauderon","year":"1993","unstructured":"M. Bauderon, Infinite Hypergraphs II. Systems of recursive equations, Theor. Comput. Sci. 103 (1993) 165\u2013190","journal-title":"Theor. Comput. Sci."},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"M. Bauderon, A Uniform approach to graph rewriting: the pullback approach Research Report 1058-95, LaBRI, Bordeaux I University 1995, WG '95, to appear, Lect. Notes in Comp. Sci.","DOI":"10.1007\/3-540-60618-1_69"},{"key":"3_CR4","unstructured":"M. Bauderon, Parallel rewriting of graphs through the pullback approach, SEGRAGRA '95, to appear, Elect. Notes in Theor. Comp. Sci."},{"key":"3_CR5","unstructured":"M. Bauderon, Infinite graphs generated by vertex replacement, in preparation, LaBRI, Bordeaux I University, 1995"},{"key":"3_CR6","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 rewriting, Math. Systems Theory 20 (1987), 83\u2013127","journal-title":"Math. Systems Theory"},{"key":"3_CR7","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0304-3975(87)90102-2","volume":"55","author":"B. Courcelle","year":"1987","unstructured":"B. Courcelle, An axiomatic definition of context-free rewriting and its applications to NLC graph grammars, Theor. Comput. Sci. 55 (1987), 141\u2013181.","journal-title":"Theor. Comput. Sci."},{"key":"3_CR8","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1007\/BFb0017374","volume":"N\u2218 532","author":"J. Engelfriet","year":"1991","unstructured":"J. Engelfriet, G. Rozenberg, Graph grammars based on node rewriting: an introduction to NLC grammars, Lect. Notes in Comp. Sci. N\u2218 532, 1991, 12\u201323.","journal-title":"Lect. Notes in Comp. Sci."},{"key":"3_CR9","first-page":"1","volume":"N\u2218 73","author":"H. Ehrig","year":"1979","unstructured":"H. Ehrig, Introduction of the algebraic theory of graph grammars, in Graph Grammars and their applications to Computer Science, Lect. Notes in Comp. Sci. N\u2218 73, 1979, 1\u201369","journal-title":"Lect. Notes in Comp. Sci."},{"issue":"No2","key":"3_CR10","doi-asserted-by":"crossref","first-page":"255","DOI":"10.4153\/CJM-1977-027-1","volume":"XXIX","author":"M. Farzan","year":"1977","unstructured":"M. Farzan, D.A. Waller, Kronecker products and local joins of graphs, Can. J. Math., Vol. XXIX, No 2 1977, 255\u2013269","journal-title":"Can. J. Math."},{"key":"3_CR11","unstructured":"A. Habel, Hyperedge Replacement: Grammars and Languages, Lect. Notes in Comp. Sci. N\u2218 643, 1992."},{"key":"3_CR12","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1007\/BFb0000107","volume":"153","author":"D. Janssens","year":"1982","unstructured":"D. Janssens, G. Rozenberg, Graph grammars with node label controlled rewriting and embedding, Lect. Notes in Comp. Sci., 153 (1982), 186\u2013205.","journal-title":"Lect. Notes in Comp. Sci."},{"key":"3_CR13","volume-title":"Categories for the working mathematician","author":"S. McLane","year":"1971","unstructured":"S. McLane, Categories for the working mathematician, Springer, Berlin, 1971"}],"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_77","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T22:01:58Z","timestamp":1555711318000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61228-9_77"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540612285","9783540683889"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-61228-9_77","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}