{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:38:49Z","timestamp":1725536329524},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642035630"},{"type":"electronic","value":"9783642035647"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03564-7_10","type":"book-chapter","created":{"date-parts":[[2009,8,20]],"date-time":"2009-08-20T03:05:35Z","timestamp":1250737535000},"page":"160-171","source":"Crossref","is-referenced-by-count":2,"title":["Context-Free Categorical Grammars"],"prefix":"10.1007","author":[{"given":"Michel","family":"Bauderon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rui","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olivier","family":"Ly","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","unstructured":"Adamek, J., Herrlich, H., Strecker, G.E.: Abstract and Concrete Categories, \n                    \n                      http:\/\/katmat.math.uni-bremen.de\/acc\/acc.pdf"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/3-540-60618-1_69","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M. Bauderon","year":"1995","unstructured":"Bauderon, M.: A uniform approach to graph rewriting: the pullback approach. In: Nagl, M. (ed.) WG 1995. LNCS, vol.\u00a01017, pp. 101\u2013115. Springer, Heidelberg (1995)"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/978-3-540-87405-8_25","volume-title":"Graph Transformations","author":"M. Bauderon","year":"2008","unstructured":"Bauderon, M., Chen, R., Ly, O.: Pullback Grammars Are Context-Free. In: Ehrig, H., Heckel, R., Rozenberg, G., Taentzer, G. (eds.) ICGT 2008. LNCS, vol.\u00a05214, pp. 366\u2013378. Springer, Heidelberg (2008)"},{"issue":"1-2","key":"10_CR4","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1016\/S0304-3975(00)00200-0","volume":"266","author":"M. Bauderon","year":"2001","unstructured":"Bauderon, M., Jacquet, H.: Node rewriting in graphs and hypergraphs: a categorical framework. Theoretical Computer Science\u00a0266(1-2), 463\u2013487 (2001)","journal-title":"Theoretical Computer Science"},{"key":"10_CR5","unstructured":"Chen, R.: Graph Transformation and Graph Grammar Based on Pullback Operation, PhD thesis, Universit\u00e9 Bordeaux 1 (2007)"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0304-3975(87)90102-2","volume":"55","author":"B. Courcelle","year":"1987","unstructured":"Courcelle, B.: An axiomatic approach to context-free rewriting and its application to NLC graph grammars. Theoretical Computer Science\u00a055, 141\u2013181 (1987)","journal-title":"Theoretical Computer Science"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Engelfriet, J., Rozenberg, G.: Node Replacement Graph Grammars. In: [9], pp. 1\u201394","DOI":"10.1142\/9789812384720_0001"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","volume-title":"Hyperedge Replacement: Grammars and Languages","author":"A. Habel","year":"1992","unstructured":"Habel, A.: Hyperedge Replacement: Grammars and Languages. LNCS, vol.\u00a0643. Springer, Heidelberg (1992)"},{"key":"10_CR9","doi-asserted-by":"publisher","DOI":"10.1142\/3303","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation","author":"G. Rozenberg","year":"1997","unstructured":"Rozenberg, G.: Handbook of Graph Grammars and Computing by Graph Transformation. World Scientific Publishing, Singapore (1997)"}],"container-title":["Lecture Notes in Computer Science","Algebraic Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03564-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T08:53:47Z","timestamp":1552121627000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03564-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642035630","9783642035647"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03564-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}