Maurice Nivat. Elements of a theory of tree codes. In Maurice Nivat and Andreas Podelski, editors, Tree Automata, Advances and Open Problems. Elsevier Science, 1992. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Feature Automata and Recognizable Sets of Feature Trees - Niehren, Podelski (1993) (17 citations) (Correct)
....of the algebra underlying feature trees. We introduce this notion in Section 2. Informally speaking, the operation composing feature trees in the algebra takes a record value and adds a record field containing another value to it. In a special case, this amounts to Nivat s notion of sum of trees [Niv92]; thus, incidentally, we obtain an algebraic formalization hereof. To define feature automata as algebras, it is useful to consider the class of all finite trees whose nodes are labeled by constructor symbols, and whose edges are labeled by feature : with the property that automata and ....
....as the operation which composes two multitrees t; t 2 MT via a feature f 2 F to a new multitree composed of t and t with an edge labeled f from the root of t to the root of . Or (where t denotes multiset union) A; E) f; t) A; E t f(f; t)g) Borrowing the tree sum notation from [Niv92], we might write ) t; f; t ) more intuitively as t ft . In fact, for the special case where F = f1; 2g (the two features denoting the left and right successor) we obtain an algebraic reading of the notation of [Niv92] The interpretation of the constants is given by f = f and A ....
[Article contains additional citation context not shown here]
Maurice Nivat. Elements of a theory of tree codes. In Maurice Nivat and Andreas Podelski, editors, Tree Automata, Advances and Open Problems. Elsevier Science, 1992.
A Feature-based Constraint System for Logic Programming .. - Aït-Kaci, Podelski.. (1992) (Correct)
....V(OE) Gamma X ; we write the tree ff(y) as t y . We will extend ff on X such that T ; ff j= OE. Given x 2 X , we define the punctual tree t x = f( A)g, where A 2 S is the sort such that Ax 2 OE, if it exists, and arbitrary, otherwise. Now we are going to use the notion of tree sum of Nivat [19], where w Gamma1 t = f(wv; A) j (v; A) 2 tg ( the tree t translated by w ) and we define: ff(x) fw Gamma1 t y j x w ; y for some y 2 V(OE) w 2 F g: Here the leads to relation w ; is given by: x ; x, and x wf ; y if x w ; y 0 and y 0 fy 2 OE, for some y 0 2 ....
M. Nivat. Elements of a theory of tree codes. In M. Nivat, A. Podelski, editors, Tree Automata (Advances and Open Problems), Amsterdam, NE, 1992. Elsevier Publishers.
A Feature Constraint System for Logic Programming with.. - Aït-Kaci, Podelski, Smolka (1992) (Correct)
....extend ff on X such that T ; ff j= OE. November 1992 Digital PRL A Feature Constraint System 7 Given x 2 X, we define the punctual tree t x = f( A)g, where A 2 S is the sort such that Ax 2 OE, if it exists, and arbitrary, otherwise. Now we are going to use the notion of tree sum of Nivat [21], where w Gamma1 t = f(wv; A) j (v; A) 2 tg ( the tree t translated by w ) and we define: ff(x) fw Gamma1 t y j x w ; y for some y 2 V(OE) w 2 F g: Here the relation w ; is given by: x ; x, and x wf ; y if x w ; y 0 and y 0 fy 2 OE, for some y 0 2 V(OE) and some ....
M. Nivat. Elements of a theory of tree codes. In M. Nivat, A. Podelski, editors, Tree Automata (Advances and Open Problems), Amsterdam, NE, 1992. Elsevier Science Publishers.
Feature Automata and Sets of Feature Trees - Niehren, Podelski (1993) (Correct)
....of the algebra underlying feature trees. We introduce this notion in Section 2. Informally speaking, the operation composing feature trees in the algebra takes a record value and adds a record field containing another value to it. In a special case, this amounts to Nivat s notion of sum of trees [Niv92]; thus, incidentally, we obtain an algebraic formalization hereof. To define feature automata as algebras, it is useful to consider the class of all finite trees whose nodes are labeled by node symbols, and whose edges are labeled by feature symbols. We call these multitrees. 2 Multitrees are of ....
....which composes two multitrees t; t 0 2 MT via a feature f 2 F to a new multitree composed of t and t 0 with an edge labeled f from the root of t to the root of t 0 . Or (where t denotes multiset union) J ( A; E) f ; t) A; E t f(f ; t)g) Borrowing the tree sum notation from [Niv92], we might write ) J (t; f ; t 0 ) more intuitively as t ft 0 . In fact, for the special case where F = f1; 2g (the two features denoting left and right successors) we obtain an algebraic reading of the notation of [Niv92] The interpretation of the constants is given by f J = f and A ....
[Article contains additional citation context not shown here]
Maurice Nivat. Elements of a theory of tree codes. In Maurice Nivat and Andreas Podelski, editors, Tree Automata, Advances and Open Problems. Elsevier Science, 1992.
A Feature Constraint System for Logic Programming with.. - Aït-Kaci, Podelski, Smolka (1992) (1 citation) (Correct)
....on V(OE) Gamma X; we write the tree ff(y) as t y . We will extend ff on X such that T ; ff j= OE. Given x 2 X, we define the punctual tree t x = f( A)g, where A 2 S is the sort such that Ax 2 OE, if it exists, and arbitrary, otherwise. Now we are going to use the notion of tree sum of Nivat [21], where w Gamma1 t = f(wv; A) j (v; A) 2 tg ( the tree t translated by w ) and we define: ff(x) fw Gamma1 t y j x w ; y for some y 2 V(OE) w 2 F g: Here the relation w ; is given by: x ; x, and x wf ; y if x w ; y 0 and y 0 fy 2 OE, for some y 0 2 V(OE) and some ....
M. Nivat. Elements of a theory of tree codes. In M. Nivat, A. Podelski, editors, Tree Automata (Advances and Open Problems), Amsterdam, NE, 1992. Elsevier Science Publishers.
A Feature-based Constraint System for Logic.. - Hassan Aït-Kaci.. (1992) (Correct)
....V(OE) Gamma X ; we write the tree ff(y) as t y . We will extend ff on X such that T ; ff j= OE. Given x 2 X , we define the punctual tree t x = f( A)g, where A 2 S is the sort such that Ax 2 OE, if it exists, and arbitrary, otherwise. Now we are going to use the notion of tree sum of Nivat [19], where w Gamma1 t = f(wv; A) j (v; A) 2 tg ( the tree t translated by w ) and we define: ff(x) fw Gamma1 t y j x w ; y for some y 2 V(OE) w 2 F g: Here the leads to relation w ; is given by: x ; x, and x wf ; y if x w ; y 0 and y 0 fy 2 OE, for some y 0 ....
M. Nivat. Elements of a theory of tree codes. In M. Nivat, A. Podelski, editors, Tree Automata (Advances and Open Problems), Amsterdam, NE, 1992. Elsevier Publishers.
A Feature-based Constraint System for Logic.. - Aït-Kaci.. (1992) (2 citations) (Correct)
No context found.
M. Nivat. Elements of a theory of tree codes. In M. Nivat, A. Podelski, editors, Tree Automata (Advances and Open Problems), Amsterdam, NE, 1992. Elsevier Publishers.
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