{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:49:40Z","timestamp":1762458580620},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540418641"},{"type":"electronic","value":"9783540453154"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45315-6_15","type":"book-chapter","created":{"date-parts":[[2007,12,3]],"date-time":"2007-12-03T06:28:39Z","timestamp":1196663319000},"page":"230-245","source":"Crossref","is-referenced-by-count":26,"title":["Computational Completeness of Programming Languages Based on Graph Transformation"],"prefix":"10.1007","author":[{"given":"Annegret","family":"Habel","sequence":"first","affiliation":[]},{"given":"Detlef","family":"Plump","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,3,23]]},"reference":[{"key":"15_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0025714","volume-title":"Proc. Graph-Grammars and Their Application to Computer Science and Biology","author":"H. Ehrig","year":"1979","unstructured":"Hartmut Ehrig. Introduction to the algebraic theory of graph grammars. In Proc. Graph-Grammars and Their Application to Computer Science and Biology, volume 73 of Lecture Notes in Computer Science, 1\u201369. Springer-Verlag, 1979."},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Claudia Ermel, Michael Rudolf, and Gabi Taentzer. The AGG approach: Language and environment. In H. Ehrig, G. Engels, H.-J. Kreowski, and G. Rozenberg, editors, Handbook of Graph Grammars and Computing by Graph Transformation, volume 2, chapter 14, 551\u2013603. World Scientific, 1999.","DOI":"10.1142\/9789812815149_0014"},{"issue":"2-3","key":"15_CR3","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/S0167-6423(97)00023-3","volume":"31","author":"P. Fradet","year":"1998","unstructured":"Pascal Fradet and Daniel Le M\u00e9tayer. Structured Gamma. Science of Computer Programming, 31(2-3):263\u2013289, 1998.","journal-title":"Science of Computer Programming"},{"key":"15_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/BFb0017401","volume-title":"Proc. Graph Grammars and Their Application to Computer Science","author":"J. Glauert","year":"1991","unstructured":"John Glauert, Richard Kennaway, and Ronan Sleep. Dactl: An experimental graph rewriting language. In Proc. Graph Grammars and Their Application to Computer Science, volume 532 of Lecture Notes in Computer Science, pages 378\u2013395. Springer-Verlag, 1991."},{"key":"15_CR5","unstructured":"Annegret Habel, J\u00fcrgen M\u00fcller, Detlef Plump. Double-pushout graph transformation revisited. Bericht Nr. 7\/99, Fachbereich Informatik, Universitat Oldenburg, 1999. Revised version to appear in Mathematical Structures in Computer Science."},{"key":"15_CR6","unstructured":"Harry R. Lewis and Christos H. Papadimitriou. Elements of the Theory of Computation. Prentice-Hall, second edition, 1998."},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Peter J. Rodgers. A graph rewriting programming language for graph drawing. In Proc. 14th IEEE Symposium on Visual Languages. IEEE Computer Society Press, 1998.","DOI":"10.1109\/VL.1998.706131"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Andy Schurr, Andreas Winter, and Albert Zundorf. The PROGRES approach: Language and environment. In H. Ehrig, G. Engels, H.-J. Kreowski, and G. Rozenberg, editors, Handbook of Graph Grammars and Computing by Graph Transformation, volume 2, chapter 13, 487\u2013550. World Scientific, 1999.","DOI":"10.1142\/9789812815149_0013"},{"key":"15_CR9","doi-asserted-by":"crossref","first-page":"11","DOI":"10.21099\/tkbjm\/1496158502","volume":"2","author":"T. Uesu","year":"1978","unstructured":"Tadahiro Uesu. A system of graph grammars which generates all recursively enumerable sets of labelled graphs. Tsukuba J. Math. 2, 11\u201326, 1978.","journal-title":"Tsukuba J. Math."},{"key":"15_CR10","unstructured":"Klaus Weihrauch. Computability. Volume 9 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1987."}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45315-6_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,5]],"date-time":"2019-05-05T13:09:57Z","timestamp":1557061797000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45315-6_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540418641","9783540453154"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-45315-6_15","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}