{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:02:19Z","timestamp":1725663739521},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540577874"},{"type":"electronic","value":"9783540483335"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57787-4_20","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:22:15Z","timestamp":1330262535000},"page":"312-325","source":"Crossref","is-referenced-by-count":9,"title":["Set-theoretic graph rewriting"],"prefix":"10.1007","author":[{"given":"Jean -Claude","family":"Raoult","sequence":"first","affiliation":[]},{"given":"Fr\u00e9d\u00e9ric","family":"Voisin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Barendregt H, van Eekelen M., Glauert J., Kennaway R., Plasmeijer M. & Sleep R.: Term Graph Rewriting, Proc. PARLE Conference, Eindhoven, 1987, Lecture Notes in Computer Science 259, pp 141\u2013158, Springer Verlag (1987).","DOI":"10.1007\/3-540-17945-3_8"},{"issue":"1987","key":"20_CR2","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/BF01692060","volume":"20","author":"M. Bauderon","year":"1987","unstructured":"Bauderon M. & Courcelle B.: Graph Expressions and Graph Rewritings, Mathematical Systems Theory, vol. 20, 1987, pp. 83\u2013127 (1987).","journal-title":"Mathematical Systems Theory"},{"issue":"2\/3","key":"20_CR3","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1016\/S0019-9958(85)80003-6","volume":"64","author":"N. Dershowitz","year":"1985","unstructured":"Dershowitz N.: Computing with rewrite Systems, in Information and Control, vol. 64 (2\/3), pp. 122\u2013157 (1985).","journal-title":"Information and Control"},{"key":"20_CR4","unstructured":"Ehrigh H., Pfender M. & Schneider H-J.: Graph Grammars: an algebraic approach, in Proc. 14th IEEE Symp. on Switching and Automata Theory, pp. 167\u2013180 (1973)."},{"key":"20_CR5","unstructured":"Ehrig H.: Tutorial Introduction to the Algebraic Approach of Graph Grammars, in 3rd Int. Workshop on Graph Grammars and their Applications to Computer Science, 1987, Ehrig, Nagl, Rozenberg & Rosenfeld (Eds), Lecture Notes in Computer Science 291, Springer Verlag, pp. 3\u201314 (1987)."},{"key":"20_CR6","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BFb0039608","volume":"247","author":"A. Habel","year":"1987","unstructured":"Habel A. & Kreowski H-J.: Some structural aspects of hypergraph languages generated by hyperedge replacement, in Proc. STACS '87, Lecture Notes in Computer Science 247, pp. 207\u2013219 (1987).","journal-title":"Lecture Notes in Computer Science"},{"key":"20_CR7","series-title":"Lecture Notes in Computer Science 332","first-page":"92","volume-title":"Recent Trends in Data Type Specification","author":"A. Habel","year":"1987","unstructured":"Habel A., Kreowski H-J. & Plump D.: Jungle Evaluation, \u201cRecent Trends in Data Type Specification,\u201d 5th Workshop on Specification of Abstract Data Types, Gullane (Scotland), 1987, Lecture Notes in Computer Science 332, pp. 92\u2013112, Springer Verlag(1987)."},{"key":"20_CR8","unstructured":"Handbook: Handbook of Theoretical Computer Science, Vol. B: Formal Methods and Semantics, J. van Leeuwen Ed., Elsevier 1990."},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Kennaway R.: On \u201cOn Graph Rewritings\u201d, in Theoretical Computer Science 52, North-Holland, pp. 37\u201358 (1987); see also Corrigendum to On \u201cOn graph Rewritings\u201d, in Theoretical Computer Science 61, North-Holland, pp. 317\u2013320 (1988).","DOI":"10.1016\/0304-3975(87)90079-X"},{"key":"20_CR10","unstructured":"Kennaway R.: Implementing Term Rewrite Languages in DACTL, in Proc. of C.A.A.P. '88, Lecture Notes in Computer Science 299, Springer Verlag, pp. 102\u2013116 (1988)."},{"key":"20_CR11","unstructured":"Kirchner C.: M\u00e9thodes et outils de conception syst\u00e9matique d'algorithmes d'unification dans les th\u00e9ories \u00e9quationnelles, Th\u00e8se d'Etat, Univ. Nancy (1985)."},{"key":"20_CR12","volume-title":"Computational Problems in Abstract Algebra","author":"D. E. Knuth","year":"1970","unstructured":"Knuth D.E. & Bendix P.B.: Simple word problems in universal algebras, in Computational Problems in Abstract Algebra, Leech J. ed., Pergamon Press, Braunschweig (1970)."},{"key":"20_CR13","unstructured":"Lafont Y.: Interaction Nets, in Principles of Prog. Languages, San Francisco, pp 95\u2013108 (1990)."},{"key":"20_CR14","unstructured":"L\u00f6we M. & Ehrig H.: Algebraic Approach to Graph Transformation Based on Single Pushout Derivations, in Proc. 16th Int. Workshop on Graph Theoretic Concepts in Computer Science (WG'90), R. H. M\u00f6hring, Lecture Notes in Computer Science 484 (1990)."},{"key":"20_CR15","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0304-3975(85)90087-8","volume":"37","author":"D. Muller","year":"1985","unstructured":"Muller D. & Schupp P. [1985] The theory of ends, pushdown automata, and second order logic, Theoretical Computer Science 37, pp 51\u201375 (1985).","journal-title":"Theoretical Computer Science"},{"key":"20_CR16","unstructured":"Nagl M.: A Tutorial and Bibliographical Survey on Graph Grammars, in 1st Int. Workshop on Graph Grammars and their Applications to Computer Science and Biology, Ehrig, Claus & Rozenberg (Eds), Lecture Notes in Computer Science 79, Springer Verlag(1979)."},{"key":"20_CR17","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1145\/322248.322251","volume":"2","author":"G. E. Peterson","year":"1981","unstructured":"Peterson G.E. & Stickel M.E.: Complete sets of reductions for some equational theories, in J. ACM 28 vol. 2, pp. 233\u2013264 (1981).","journal-title":"J. ACM 28"},{"key":"20_CR18","unstructured":"Raoult J-C.: On Graph Rewritings, in Theoretical Computer Science 32, North-Holland, pp. 1\u201324 (1984)."},{"key":"20_CR19","volume-title":"D\u00e9monstration Automatique: techniques de r\u00e9\u00e9criture","author":"M. Rusinowitch","year":"1989","unstructured":"Rusinowitch M.: D\u00e9monstration Automatique: techniques de r\u00e9\u00e9criture, Inter Editions, Paris, 1989."},{"key":"20_CR20","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/3-540-17220-3_6","volume":"256","author":"E. Sopena","year":"1987","unstructured":"Sopena E.: Combinatorial hypermap rewriting, in Proc. RTA 87, Bordeaux, Lecture Notes in Computer Science 256 pp. 62\u201373 (1987).","journal-title":"Lecture Notes in Computer Science"}],"container-title":["Lecture Notes in Computer Science","Graph Transformations in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57787-4_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:14:08Z","timestamp":1605647648000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57787-4_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540577874","9783540483335"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-57787-4_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}