{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:50:26Z","timestamp":1725490226477},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540443100"},{"type":"electronic","value":"9783540458326"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45832-8_16","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T15:13:34Z","timestamp":1188314014000},"page":"192-206","source":"Crossref","is-referenced-by-count":1,"title":["Hyperedge Substitution in Basic Atom-Replacement Languages"],"prefix":"10.1007","author":[{"given":"Renate","family":"Klempien-Hinrichs","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,10,24]]},"reference":[{"key":"16_CR1","first-page":"143","volume":"14","author":"Y. Bar-Hillel","year":"1961","unstructured":"Y. Bar-Hillel, M. Perles, and E. Shamir. On formal properties of simple phrase structure grammars. Zeitschrift f\u00fcr Phonetik, Sprachwissenschaft und Kommunikationsforschung, 14:143\u2013177, 1961.","journal-title":"Zeitschrift f\u00fcr Phonetik, Sprachwissenschaft und Kommunikationsforschung"},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/0022-0000(93)90004-G","volume":"46","author":"B. Courcelle","year":"1993","unstructured":"Bruno Courcelle, Joost Engelfriet, and Grzegorz Rozenberg. Handle-rewriting hypergraph grammars. Journal of Computer and System Sciences, 46:218\u2013270, 1993.","journal-title":"Journal of Computer and System Sciences"},{"key":"16_CR3","doi-asserted-by":"publisher","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":"16_CR4","doi-asserted-by":"crossref","unstructured":"Frank Drewes, Annegret Habel, and Hans-J\u00f6rg Kreowski. Hyperedge replacement graph grammars. In G. Rozenberg, editor, Handbook of Graph Grammars and Computing by Graph Transformation. Vol. I: Foundations, chapter 2, pages 95\u2013162. World Scientific, 1997.","DOI":"10.1142\/9789812384720_0002"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Joost Engelfriet. Context-free graph grammars. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages. Vol. III: Beyond Words, chapter 3, pages 125\u2013213. Springer, 1997.","DOI":"10.1007\/978-3-642-59126-6_3"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Joost Engelfriet and Grzegorz Rozenberg. Node replacement graph grammars. In G. Rozenberg, editor, Handbook of Graph Grammars and Computing by Graph Transformation. Vol. I: Foundations, chapter 1, pages 1\u201394. World Scientific, 1997.","DOI":"10.1142\/9789812384720_0001"},{"key":"16_CR7","series-title":"Lect Notes Comput Sci","volume-title":"Hyperedge Replacement: Grammars and Languages","author":"A. Habel","year":"1992","unstructured":"Annegret Habel. Hyperedge Replacement: Grammars and Languages, volume 643 of Lecture Notes in Computer Science. Springer, 1992."},{"key":"16_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/3-540-61228-9_101","volume-title":"Proc. Fifth Intl. Workshop on Graph Grammars and Their Application to Comp. Sci.","author":"R. Klempien-Hinrichs","year":"1996","unstructured":"Renate Klempien-Hinrichs. Node replacement in hypergraphs: Simulation of hyperedge replacement, and decidability of confluence. In J. Cuny, H. Ehrig, G. Engels, and G. Rozenberg, editors, Proc. Fifth Intl. Workshop on Graph Grammars and Their Application to Comp. Sci., volume 1073 of Lecture Notes in Computer Science, pages 397\u2013411. Springer, 1996."},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/A:1009962417549","volume":"2","author":"R. Klempien-Hinrichs","year":"1999","unstructured":"Renate Klempien-Hinrichs. The generative power of context-free node rewriting in hypergraphs. Grammars, 2:211\u2013221, 1999.","journal-title":"Grammars"},{"key":"16_CR10","unstructured":"Renate Klempien-Hinrichs. Context-free Hypergraph Grammars. Node and Hyperedge Rewriting with an Application to Petri Nets. Books on Demand, Norderstedt, 2001. Doctoral thesis, Universit\u00e4t Bremen, 2000."},{"key":"16_CR11","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1145\/321356.321364","volume":"13","author":"R. J. Parikh","year":"1966","unstructured":"Rohit J. Parikh. On context-free languages. Journal of the Association for Computing Machinery, 13:570\u2013581, 1966.","journal-title":"Journal of the Association for Computing Machinery"}],"container-title":["Lecture Notes in Computer Science","Graph Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45832-8_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,23]],"date-time":"2019-02-23T05:14:13Z","timestamp":1550898853000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45832-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540443100","9783540458326"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-45832-8_16","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}