J. Engelfriet and H. Vogler. The equivalence of bottom-up and top-down treeto -graph transducers. J. Comput. Syst. Sci., 56:332-356, 1998. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Annual Report 1999: Foundations of Programming - Vogler (1999) (Correct)
.... study the following concepts: ffl primitive recursion on trees ( EV91] ffl arbitrary tree walking ( FHVV93, KV94b] ffl higher order functions ( EV88] ffl composition and decomposition ( EV85, KV94b, Kuh97a, Kuh98, Kuh99a] ffl parsing and simultaneous evaluation ( NV94] ffl hypergraphs ([EV94, EV98]) ffl tools for proving that a language is not an element of a class of languages, in particular pumping lemmata ( KV94a, Kuh95, Kuh96, Kuh97a, Kuh97b] In [FV98] formal models of syntax directed semantics are introduced and their computational power is compared. The models are based on the ....
J. Engelfriet and H. Vogler. The equivalence of bottom-up and top-down treeto -graph transducers. J. Comput. Syst. Sci., 56:332--356, 1998.
A Characterization of the Sets of Hypertrees Generated by.. - Drewes (1997) (5 citations) (Correct)
....[BC87] and Habel and Kreowski [HK87] This work was continued in diverse directions. For references see, e.g. Hab92] Eng97] and [Roz97, Chapters 1, 2, and 5] Results that establish in different ways connections between tree transductions and hyperedge replacement can be found in, e.g. [EH91, EH92, Eng94, EV94, EV96, Dre96]. The notion of hypergraphs to be used in this paper is defined below. 3.1 Definition (pointed hypergraph) A pointed hypergraph is a tuple G = V; E; att ; lab; point) where ffl V is the finite set of nodes, ffl E with E V = is the finite set of hyperedges, ffl att : E V is the ....
Joost Engelfriet and Heiko Vogler. The equivalence of bottom-up and top-down tree-to-graph transducers. Tech. Report TUD/FI96/17, TU Dresden, 1996.
Annual Report 2000: Foundations of Programming - Vogler (2000) Self-citation (Vogler) (Correct)
.... We study the following concepts: primitive recursion on trees ( EV91] arbitrary tree walking ( FHVV93, KV94b] higher order functions ( EV88] composition and decomposition ( EV85, KV94b, K uh97a, K uh98, K uh99a] parsing and simultaneous evaluation ( NV94] hypergraphs ([EV94, EV98]) tools for proving that a language is not an element of a class of languages, in particular pumping lemmata ( KV94a, K uh95, K uh96, K uh97a, K uh97b] In [FV98] formal models of syntax directed semantics are introduced and their computational power is compared. The models are based on the ....
J. Engelfriet and H. Vogler. The equivalence of bottom-up and top-down treeto -graph transducers. J. Comput. Syst. Sci., 56:332-356, 1998.
Annual Report 1998: Foundations of Programming - Vogler (1998) Self-citation (Vogler) (Correct)
....was assigned and for each production of the hypergraph grammar a set of rules for the local information transfer was defined. For the resulting concept typical problems such as expressional power, decidability questions, and decomposition into simpler parts, are to be considered. In [EV94] and in [EV98] two hypergraph generating mechanisms, which are controlled by input trees, are compared. Recent results of this project are contained in [MV98] 4.2 Formal models of syntax directed semantics Members: Armin Kuhnemann and Heiko Vogler Contents: In this project we define different concepts for ....
.... We study the following concepts: ffl primitive recursion on trees ( EV91] ffl arbitrary tree walking ( FHVV93, KV94b] ffl higher order functions ( EV88] ffl composition and decomposition ( EV85, KV94b, Kuh97a, Kuh98] ffl parsing and simultaneous evaluation ( NV94] ffl hypergraphs ([EV94, EV98]) ffl tools for proving that a language is not an element of a class of languages, in particular pumping lemmata ( KV94a, Kuh95, Kuh96, Kuh97a, Kuh97b] Foundations of Programming In [FV98] formal models of syntax directed semantics are introduced and their computational power is compared. The ....
J. Engelfriet and H. Vogler. The equivalence of bottom-up and top-down treeto -graph transducers. J. Comput. Syst. Sci., 56:332--356, 1998.
Annual Report 1997 of the Professorship "Foundations of.. - Vogler (1997) Self-citation (Vogler) (Correct)
....assigned and for each production of the hypergraph grammar a set of rules for the local information transfer will be defined. For the resulting concept typical problems such as expressional power, decidability questions, and decomposition into simpler parts, are to be considered. In [EV94] and in [EV96] two hypergraph generating mechanisms, which are controlled by input trees, are compared. Recent results of this project are contained in [MV97a] 4.2 Formal models of syntax directed semantics Members: Armin Kuhnemann and Heiko Vogler Contents: In this project we formalize the concepts which ....
.... ffl primitive recursion on trees ( EV91] ffl arbitrary tree walking ( FHVV93, KV94b] ffl higher order functions ( EV88] ffl composition and decomposition ( KV94b, Kuh97a] ffl parsing and simultaneous evaluation ( NV94] Professorship Foundations of Programming ffl hypergraphs ([EV94, EV96]) ffl tools for proving that a language is not an element of a class of languages, in particular pumping lemmata ( KV94a, Kuh95, Kuh96, Kuh97a, Kuh97b] In [FV97b] formal models of syntax directed semantics are introduced and their computational power is compared. The models are based on the ....
J. Engelfriet and H. Vogler. The equivalence of bottom-up and top-down treeto -graph transducers. Technical Report TUD/FI96/17, Technical University of Dresden, 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC