{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:12Z","timestamp":1761611172159},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540634379"},{"type":"electronic","value":"9783540695479"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0029966","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T06:24:59Z","timestamp":1133418299000},"page":"229-238","source":"Crossref","is-referenced-by-count":1,"title":["On the generation of trees by hyperedge replacement"],"prefix":"10.1007","author":[{"given":"Frank","family":"Drewes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,17]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/S0019-9958(71)90706-6","volume":"19","author":"A. V. Aho","year":"1971","unstructured":"Alfred V. Aho and Jeffrey D. Ullman. Translations on a context free grammar. Information and Control, 19:439\u2013475, 1971.","journal-title":"Information and Control"},{"key":"23_CR2","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0304-3975(91)90387-H","volume":"80","author":"B. Courcelle","year":"1991","unstructured":"Bruno Courcelle. The monadic second-order logic of graphs V: on closing the gap between definability and recognizability. Theoretical Computer Science, 80:153\u2013202, 1991.","journal-title":"Theoretical Computer Science"},{"key":"23_CR3","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 Transformations. Vol. I: Foundations, chapter 2, pages 95\u2013162. World Scientific, 1997.","DOI":"10.1142\/9789812384720_0002"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Frank Drewes. A characterization of the sets of hypertrees generated by hyperedge-replacement graph grammars. Report 3\/97, Univ. Bremen, 1997.","DOI":"10.1142\/9789812384720_0002"},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1016\/0022-0000(91)90018-Z","volume":"43","author":"J. Engelfriet","year":"1991","unstructured":"Joost Engelfriet and Linda Heyker. The string generating power of context-free hypergraph grammars. Journal of Computer and System Sciences, 43:328\u2013360, 1991.","journal-title":"Journal of Computer and System Sciences"},{"key":"23_CR6","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/BF01683280","volume":"10","author":"J. Engelfriet","year":"1977","unstructured":"Joost Engelfriet. Top-down tree transducers with regular look-ahead. Mathematical Systems Theory, 10:289\u2013303, 1977.","journal-title":"Mathematical Systems Theory"},{"key":"23_CR7","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":"23_CR8","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/0022-0000(80)90058-6","volume":"20","author":"J. Engelfriet","year":"1980","unstructured":"Joost Engelfriet, Grzegorz Rozenberg, and Giora Slutzki. Tree transducers, L systems, and two-way machines. Journal of Computer and System Sciences, 20:150\u2013202, 1980.","journal-title":"Journal of Computer and System Sciences"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Ferenc G\u00e9cseg and Magnus Steinby. Tree languages. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages. Vol. III: Beyond Words, chapter 1, pages 1\u201368. Springer, 1997.","DOI":"10.1007\/978-3-642-59126-6_1"},{"key":"23_CR10","unstructured":"Annegret Habel. Hyperedge Replacement: Grammars and Languages, volume 643 of Lecture Notes in Computer Science. Springer-Verlag, 1992."},{"key":"23_CR11","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0019-9958(67)90353-1","volume":"11","author":"J. Mezei","year":"1967","unstructured":"J. Mezei and Jesse B. Wright. Algebraic automata and context-free sets. Information and Control, 11:3\u201329, 1967.","journal-title":"Information and Control"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1997"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0029966","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T08:22:29Z","timestamp":1586593349000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029966"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540634379","9783540695479"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/bfb0029966","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}