{"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":1761611184506},"publisher-location":"Berlin, Heidelberg","reference-count":11,"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_101","type":"book-chapter","created":{"date-parts":[[2006,7,17]],"date-time":"2006-07-17T14:17:05Z","timestamp":1153145825000},"page":"397-411","source":"Crossref","is-referenced-by-count":8,"title":["Node replacement in hypergraphs: Simulation of hyperedge replacement, and decidability of confluence"],"prefix":"10.1007","author":[{"given":"Renate","family":"Klempien-Hinrichs","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,9,7]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Franz J. Brandenburg: On polynomial time graph grammars. In: STACS 88 (R. Cori, Martin Wirsing, Eds.), Lecture Notes in Computer Science 294, 227\u2013236, 1988.","DOI":"10.1007\/BFb0035847"},{"key":"27_CR2","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0304-3975(87)90102-2","volume":"55","author":"B. Courcelle","year":"1987","unstructured":"Bruno Courcelle: An axiomatic definition of context-free rewriting and its application to NLC graph grammars. Theoretical Computer Science 55, 141\u2013181, 1987.","journal-title":"Theoretical Computer Science"},{"key":"27_CR3","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/0022-0000(93)90004-G","volume":"46","author":"B. Courcelle","year":"1993","unstructured":"Bruno Courcelle, Joost Engelfriet, Grzegorz Rozenberg: Handle-rewriting hypergraph grammars. Journal of Computer and System Science 46, 218\u2013270, 1993.","journal-title":"Journal of Computer and System Science"},{"key":"27_CR4","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0890-5401(90)90038-J","volume":"84","author":"J. Engelfriet","year":"1990","unstructured":"Joost Engelfriet, Grzegorz Rozenberg: A comparison of boundary graph grammars and context-free hypergraph grammars. Information and Computation 84, 163\u2013206, 1990.","journal-title":"Information and Computation"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Joost Engelfriet, Grzegorz Rozenberg: Graph grammars based on node rewriting: an introduction to NLC graph grammars. In: Graph Grammars and Their Application to Computer Science (Hartmut Ehrig, Hans-J\u00f6rg Kreowski, Grzegorz Rozenberg, Eds.), Lecture Notes in Computer Science 532, 12\u201323, 1991.","DOI":"10.1007\/BFb0017374"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Rainer Fehling: A concept of hierarchical Petri nets with building blocks. In: Advances in Petri Nets (Grzegorz Rozenberg, Ed.), Lecture Notes in Computer Science 674, 148\u2013168, 1993.","DOI":"10.1007\/3-540-56689-9_43"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Rob van Glabbeek, Ursula Goltz: Refinement of actions in causality based models. In: Stepwise Refinement of Distributed Systems (Jaco W. de Bakker, Willem Paul de Roever, Grzegorz Rozenberg, Eds.), Lecture Notes in Computer Science 430, 267\u2013300, 1990.","DOI":"10.1007\/3-540-52559-9_68"},{"key":"27_CR8","unstructured":"Annegret Habel: Hyperedge Replacement: Grammars and Languages. Lecture Notes in Computer Science 643, 1992."},{"key":"27_CR9","unstructured":"Manfred Kaul: Syntaxanalyse von Graphen bei Pr\u00e4zedenz-Graph-Grammatiken. Ph.D. thesis, Osnabr\u00fcck 1985. Report MIP-8610, Passau 1986."},{"key":"27_CR10","unstructured":"Changwook Kim, Tae Eui Jeong: HRNCE grammars \u2014 a hypergraph generating system with an eNCE way of rewriting. This volume."},{"key":"27_CR11","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF02241984","volume":"16","author":"M. Nagl","year":"1976","unstructured":"Manfred Nagl: Formal languages of labelled graphs. Computing 16, 113\u2013137, 1976.","journal-title":"Computing"}],"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_101","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,6]],"date-time":"2019-02-06T12:49:45Z","timestamp":1549457385000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61228-9_101"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540612285","9783540683889"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-61228-9_101","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}