{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:18:33Z","timestamp":1725455913379},"publisher-location":"Berlin\/Heidelberg","reference-count":22,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354054478X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0017398","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T07:32:12Z","timestamp":1132644732000},"page":"328-343","source":"Crossref","is-referenced-by-count":1,"title":["The term generating power of context-free hypergraph grammars"],"prefix":"10.1007","author":[{"given":"Joost","family":"Engelfriet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Linda","family":"Heyker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","volume-title":"The Theory of Parsing, Translation, and Compiling","author":"A.V. Aho","year":"1972","unstructured":"A.V. Aho, J.D. Ullman; \"The Theory of Parsing, Translation, and Compiling\", Prentice-Hall Inc., Englewood Cliffs, New Jersey, 1972."},{"key":"26_CR2","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/BF01692060","volume":"20","author":"M. Bauderon","year":"1987","unstructured":"M. Bauderon, B. Courcelle; Graph expressions and graph rewritings, Mathematical Systems Theory 20 (1987), 83\u2013127.","journal-title":"Mathematical Systems Theory"},{"key":"26_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(86)90050-2","volume":"42","author":"B. Courcelle","year":"1986","unstructured":"B. Courcelle; Equivalences and transformations of regular systems, applications to recursive program schemes and grammars, Theoretical Computer Science 42 (1986), 1\u2013122.","journal-title":"Theoretical Computer Science"},{"key":"26_CR4","unstructured":"B.Courcelle; On using context-free graph grammars for analyzing recursive definitions, in \"Programming of future generation computers, II\" (K.Fuchi, L.Kott, eds.), Elsevier Pub.Co., 1988, 83\u2013122."},{"key":"26_CR5","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B. Courcelle","year":"1990","unstructured":"B. Courcelle; The monadic second-order logic of graphs, I: recognizable sets of finite graphs, Information and Computation 85 (1990), 12\u201375. See also [EhrNagRosRoz], 133\u2013146.","journal-title":"Information and Computation"},{"key":"26_CR6","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0304-3975(82)90003-2","volume":"17","author":"B. Courcelle","year":"1982","unstructured":"B. Courcelle, P. Franchi-Zannettacci; Attribute grammars and recursive program schemes I and II, Theoretical Computer Science 17 (1982), 163\u2013191, 235\u2013257.","journal-title":"Theoretical Computer Science"},{"key":"26_CR7","series-title":"Lecture Notes in Computer Science","volume-title":"Attribute grammars; Definitions, Systems and Bibliography","author":"P. Deransart","year":"1988","unstructured":"P. Deransart, M. Jourdan, B. Lorho, \"Attribute grammars; Definitions, Systems and Bibliography\", Lecture Notes in Computer Science 323, Springer-Verlag, Berlin, 1988."},{"key":"26_CR8","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0019-9958(77)90309-6","volume":"35","author":"J. Duske","year":"1977","unstructured":"J. Duske, R. Parchmann, M. Sedello, J. Specht; 10-macrolanguages and attributed translations, Information and Control 35 (1977), 87\u2013105.","journal-title":"Information and Control"},{"key":"26_CR9","series-title":"Lecture Notes in Computer Science","volume-title":"Graph-Grammars and their Application to Computer Science","year":"1987","unstructured":"H. Ehrig, M. Nagl, G. Rozenberg, A. Rosenfeld (eds.); \"Graph-Grammars and their Application to Computer Science\", Lecture Notes in Computer Science 291, Springer-Verlag, Berlin, 1987."},{"key":"26_CR10","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/BF00289307","volume":"16","author":"J. Engelfriet","year":"1981","unstructured":"J. Engelfriet, G. Fil\u00e8; The formal power of one-visit attribute grammars, Acta Informatica 16 (1981), 275\u2013302.","journal-title":"Acta Informatica"},{"key":"26_CR11","unstructured":"J.Engelfriet, L.M.Heyker; The string generating power of context-free hypergraph grammars, Report 89-05, Leiden University, 1989, to appear in Journal of Computer and System Sciences."},{"key":"26_CR12","unstructured":"J.Engelfriet, L.M.Heyker; The term-generating power of context-free hypergraph grammars and attribute grammars, Report 89-17, Leiden University, 1989."},{"key":"26_CR13","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1007\/BF00279953","volume":"25","author":"J. Engelfriet","year":"1988","unstructured":"J. Engelfriet, G. Leih, G. Rozenberg; Apex graph grammars and attribute grammars, Acta Informatica 25 (1988), 537\u2013571.","journal-title":"Acta Informatica"},{"key":"26_CR14","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0022-0000(85)90066-2","volume":"31","author":"J. Engelfriet","year":"1985","unstructured":"J. Engelfriet, H. Vogler; Macro tree transducers, Journal of Computer and System Sciences 31 (1985), 71\u2013146.","journal-title":"Journal of Computer and System Sciences"},{"key":"26_CR15","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/BF00264472","volume":"19","author":"G. Fil\u00e8","year":"1983","unstructured":"G. Fil\u00e8; Interpretation and reduction of attribute grammars, Acta Informatica 19 (1983), 115\u2013150.","journal-title":"Acta Informatica"},{"key":"26_CR16","unstructured":"A.Habel; Hyperedge replacement: grammars and languages, Ph.D.Thesis, Bremen, 1989."},{"key":"26_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/3-540-18771-5_41","volume-title":"Graph-Grammars and their Application to Computer Science","author":"A. Habel","year":"1987","unstructured":"A. Habel, H.-J. Kreowski; May we introduce to you: hyperedge replacement, in 15\u201326."},{"key":"26_CR18","series-title":"Lecture Notes in Computer Science","first-page":"92","volume-title":"Recent Trends in Data Type Specification","author":"A. Habel","year":"1987","unstructured":"A. Habel, H.-J. Kreowski, D. Plump; Jungle evaluation, in: \"Recent Trends in Data Type Specification\" (D. Sanella, A. Tarlecki, eds.), Lecture Notes in Computer Science 332, Springer-Verlag, Berlin, 1987, 92\u2013112."},{"key":"26_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/BFb0000105","volume-title":"Graph-Grammars and their Application to Computer Science","author":"B. Hoffman","year":"1983","unstructured":"B. Hoffman; Modelling compiler generation by graph grammars, in: \"Graph-Grammars and their Application to Computer Science\" (H. Ehrig, M. Nagl, G. Rozenberg, eds.), Lecture Notes in Computer Science 153, Springer-Verlag, Berlin, 1983, 159\u2013171."},{"key":"26_CR20","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF01692511","volume":"2","author":"D.E. Knuth","year":"1968","unstructured":"D.E. Knuth; Semantics of context-free languages, Mathematical Systems Theory 2 (1968), 127\u2013145. Correction: Mathematical Systems Theory 5 (1971), 95\u201396.","journal-title":"Mathematical Systems Theory"},{"key":"26_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1007\/BFb0026094","volume-title":"CAAP '88 Proceedings","author":"C. Lautemann","year":"1988","unstructured":"C. Lautemann; Decomposition trees: structured graph representation and efficient algorithms, in: CAAP '88 Proceedings (M. Dauchet, M. Nivat, eds.), Lecture Notes in Computer Science 299, Springer-Verlag, Berlin, 1988, 28\u201339."},{"key":"26_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/3-540-10250-7_25","volume-title":"Semantics-directed compiler generation","author":"O.L. Madsen","year":"1980","unstructured":"O.L. Madsen, On defining semantics by means of extended attribute grammars, in: \"Semantics-directed compiler generation\" (N.D. Jones, ed.), Lecture Notes in Computer Science 94, Springer-Verlag, Berlin, 1980, 259\u2013299."}],"container-title":["Lecture Notes in Computer Science","Graph Grammars and Their Application to Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0017398.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:10:35Z","timestamp":1706746235000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0017398"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354054478X"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/bfb0017398","relation":{},"subject":[]}}