{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T03:50:05Z","timestamp":1768276205845,"version":"3.49.0"},"reference-count":49,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,10,1]],"date-time":"1994-10-01T00:00:00Z","timestamp":780969600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6864,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1994,10]]},"DOI":"10.1016\/s0022-0000(05)80050-9","type":"journal-article","created":{"date-parts":[[2005,8,20]],"date-time":"2005-08-20T11:18:35Z","timestamp":1124536715000},"page":"258-305","source":"Crossref","is-referenced-by-count":14,"title":["The translation power of top-down tree-to-graph transducers"],"prefix":"10.1016","volume":"49","author":[{"given":"Joost","family":"Engelfriet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heiko","family":"Vogler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(05)80050-9_bib1","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1016\/S0019-9958(77)90308-4","article-title":"Controlled iteration grammars and full hyper AFL's","volume":"34","author":"Asveld","year":"1977","journal-title":"Inform. and Control"},{"key":"10.1016\/S0022-0000(05)80050-9_bib2","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/S0019-9958(71)90706-6","article-title":"Translations on a context free grammar","volume":"19","author":"Aho","year":"1971","journal-title":"Inform. and Control"},{"key":"10.1016\/S0022-0000(05)80050-9_bib3","series-title":"The Theory of Parsing, Translation and Compiling, Vol. I, Vol. II","author":"Aho","year":"1973"},{"key":"10.1016\/S0022-0000(05)80050-9_bib4","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1137\/0207030","article-title":"Generalized syntax directed translation, tree transducers, and linear space","volume":"7","author":"Baker","year":"1978","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(05)80050-9_bib5","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF01692060","article-title":"Graph expressions and graph rewritings","volume":"20","author":"Bauderon","year":"1987","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0022-0000(05)80050-9_bib6_1","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0304-3975(82)90003-2","article-title":"Attribute grammars and recursive program schemes","volume":"17","author":"Courcelle","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0022-0000(05)80050-9_bib6_2","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0304-3975(82)90024-X","article-title":"Attribute grammars and recursive program schemes","volume":"17","author":"Courcelle","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0022-0000(05)80050-9_bib7","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0304-3975(83)90059-2","article-title":"Fundamental properties of infinite trees","volume":"25","author":"Courcelle","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0022-0000(05)80050-9_bib8","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0304-3975(87)90102-2","article-title":"An axiomatic definition of context-free rewriting and its application to NLC graph grammars","volume":"55","author":"Courcelle","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0022-0000(05)80050-9_bib9","series-title":"Graph-Grammars and Their Application to Computer Science","first-page":"133","article-title":"On context-free sets of graphs and their monadic second-order theory","volume":"Vol. 291","author":"Courcelle","year":"1987"},{"key":"10.1016\/S0022-0000(05)80050-9_bib10","series-title":"Programming of Future Generation Computers II","first-page":"83","article-title":"On the use of context-free graph grammars for analysing recursive definitions","author":"Courcelle","year":"1988"},{"key":"10.1016\/S0022-0000(05)80050-9_bib11","first-page":"193","article-title":"Graph rewriting: An algebraic and logic approach","volume":"Vol. B","author":"Courcelle","year":"1990"},{"key":"10.1016\/S0022-0000(05)80050-9_bib12","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0747-7171(87)80022-6","article-title":"Termination of rewriting","volume":"3","author":"Dershowitz","year":"1987","journal-title":"J. Symbol. Comput."},{"key":"10.1016\/S0022-0000(05)80050-9_bib13","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1145\/359138.359142","article-title":"Proving termination with multiset orderings","volume":"22","author":"Dershowitz","year":"1979","journal-title":"Comm. ACM"},{"key":"10.1016\/S0022-0000(05)80050-9_bib14","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1016\/0022-0000(91)90018-Z","article-title":"The string-generating power of context-free hypergraph grammars","volume":"43","author":"Engelfriet","year":"1991","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(05)80050-9_bib15","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF01178504","article-title":"Context-free hypergraph grammars have the same termgenerating power as attribute grammars","volume":"29","author":"Engelfriet","year":"1992","journal-title":"Acta Inform."},{"key":"10.1016\/S0022-0000(05)80050-9_bib16","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1007\/BF01704020","article-title":"Bottom-up and top-down tree transformations\u2014A comparison","volume":"9","author":"Engelfriet","year":"1975","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0022-0000(05)80050-9_bib17","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0304-3975(76)90003-7","article-title":"Surface tree languages and parallel derivation trees","volume":"2","author":"Engelfriet","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0022-0000(05)80050-9_bib18","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/BF01683280","article-title":"Top-down tree transducers with regular look-ahead","volume":"10","author":"Engelfriet","year":"1977","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0022-0000(05)80050-9_bib19","series-title":"Formal Language Theory; Perspectives and Open Problems","article-title":"Some open questions and recent results on tree transducers and tree languages","author":"Engelfriet","year":"1980"},{"key":"10.1016\/S0022-0000(05)80050-9_bib20","article-title":"Tree Transducers and Syntax-Directed Semantics","volume":"363","author":"Engelfriet","year":"1981"},{"key":"10.1016\/S0022-0000(05)80050-9_bib21","article-title":"Context-free Grammars with Storage","author":"Engelfriet","year":"1986"},{"key":"10.1016\/S0022-0000(05)80050-9_bib22","series-title":"The Book of L","first-page":"101","article-title":"The ET0L-hierarhy is inside the OI-hierarchy","author":"Engelfriet","year":"1986"},{"key":"10.1016\/S0022-0000(05)80050-9_bib23","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0890-5401(90)90038-J","article-title":"A comparison of boundary graph grammars and context-free hypergraph grammars","volume":"84","author":"Engelfriet","year":"1990","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0022-0000(05)80050-9_bib24","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/0022-0000(80)90058-6","article-title":"Tree transducers, L systems, and two-way machines","volume":"20","author":"Engelfriet","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(05)80050-9_bib25","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0022-0000(85)90066-2","article-title":"Macro tree transducers","volume":"31","author":"Engelfriet","year":"1985","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(05)80050-9_bib26","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF02915449","article-title":"High level tree transducers and iterated pushdown tree transducers","volume":"26","author":"Engelfriet","year":"1988","journal-title":"Acta Inform."},{"key":"10.1016\/S0022-0000(05)80050-9_bib27","article-title":"Attributumors fatranszformatorok","author":"F\u00fcl\u00f6p","year":"1981"},{"key":"10.1016\/S0022-0000(05)80050-9_bib28","first-page":"261","article-title":"On attributed tree transducers","volume":"5","author":"F\u00fcl\u00f6p","year":"1981","journal-title":"Acta Cybernet."},{"key":"10.1016\/S0022-0000(05)80050-9_bib29","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0020-0190(89)90178-6","article-title":"Top-down tree transducers with deterministic top-down lookahead","volume":"33","author":"F\u00fcl\u00f6p","year":"1989","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0022-0000(05)80050-9_bib30","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF02088010","article-title":"Variants of top-down tree transducers with look-ahead","volume":"21","author":"F\u00fcl\u00f6p","year":"1989","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0022-0000(05)80050-9_bib31","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/S0019-9958(75)90106-0","article-title":"T0L schemes and control sets","volume":"27","author":"Ginsburg","year":"1975","journal-title":"Inform. and Control"},{"key":"10.1016\/S0022-0000(05)80050-9_bib32","series-title":"Tree Automata","author":"G\u00e9cseg","year":"1984"},{"key":"10.1016\/S0022-0000(05)80050-9_bib33","article-title":"Hyperedge-Replacement: Grammars and Languages","volume":"Vol. 643","author":"Habel","year":"1992"},{"key":"10.1016\/S0022-0000(05)80050-9_bib34","series-title":"Graph Grammars and Their Application to Computer Science","first-page":"15","article-title":"May we introduce to you: Hyperedge replacement","volume":"Vol. 291","author":"Habel","year":"1987"},{"key":"10.1016\/S0022-0000(05)80050-9_bib35","series-title":"STACS 87","first-page":"207","article-title":"Some structural aspects of hypergraph languages generated by hyperedge replacement","volume":"Vol. 247","author":"Habel","year":"1987"},{"key":"10.1016\/S0022-0000(05)80050-9_bib36","first-page":"37","article-title":"Jungle evaluation","volume":"15","author":"Habel","year":"1991","journal-title":"Fund. Inform."},{"key":"10.1016\/S0022-0000(05)80050-9_bib37","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1145\/322217.322230","article-title":"Confluent reductions: Abstract properties and applications to term rewriting systems","volume":"27","author":"Huet","year":"1980","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0022-0000(05)80050-9_bib38","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1145\/366062.366083","article-title":"A syntax directed compiler for ALGOL 60","volume":"4","author":"Irons","year":"1961","journal-title":"Comm. ACM"},{"key":"10.1016\/S0022-0000(05)80050-9_bib39","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01692511","article-title":"Semantics of context-free languages","volume":"2","author":"Knuth","year":"1968","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0022-0000(05)80050-9_bib40","series-title":"Lindenmayer Systems; Impacts on Theoretical Computer Science, Computer Graphics, and Developmental Biology","first-page":"271","article-title":"Parallel hyperedge replacement","author":"Kreowski","year":"1992"},{"key":"10.1016\/S0022-0000(05)80050-9_bib41","series-title":"Conf. Rec. of 3rd Symp. on Principles of Programming Languages","first-page":"32","article-title":"Automatic generation of efficient evaluators for attribute grammars","author":"Kennedy","year":"1976"},{"key":"10.1016\/S0022-0000(05)80050-9_bib42","series-title":"Proceedings, 10th ICALP","first-page":"723","article-title":"Context-free controlled ET0L systems","volume":"Vol. 154","author":"Lange","year":"1983"},{"key":"10.1016\/S0022-0000(05)80050-9_bib43","series-title":"Proceedings, CAAP 88","first-page":"28","article-title":"Decomposition trees: Structured graph representation and efficient algorithms","volume":"Vol. 299","author":"Lautemann","year":"1988"},{"key":"10.1016\/S0022-0000(05)80050-9_bib44","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/BF00289017","article-title":"The complexity of graph languages generated by hyperedge replacement","volume":"27","author":"Lautemann","year":"1990","journal-title":"Acta Inform."},{"key":"10.1016\/S0022-0000(05)80050-9_bib45","series-title":"Graph Grammars and Their Application to Computer Science","first-page":"440","article-title":"An efficient algorithm for the solution of hierarchical networks of constraints","volume":"Vol. 291","author":"Montanari","year":"1987"},{"key":"10.1016\/S0022-0000(05)80050-9_bib46","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/BF01695769","article-title":"Mappings and grammars on trees","volume":"4","author":"Rounds","year":"1970","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0022-0000(05)80050-9_bib47","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/S0022-0000(70)80017-4","article-title":"Generalized2 sequential machine maps","volume":"4","author":"Thatcher","year":"1970","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(05)80050-9_bib48","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF01691346","article-title":"Generalized finite automata theory with application to a decision problem of second-order logic","volume":"2","author":"Thatcher","year":"1968","journal-title":"Math. Systems Theory"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800509?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800509?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,22]],"date-time":"2019-01-22T22:27:17Z","timestamp":1548196037000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000005800509"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,10]]},"references-count":49,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,10]]}},"alternative-id":["S0022000005800509"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(05)80050-9","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1994,10]]}}}