Exponential output size of top-down tree transducers

1999 ◽  
pp. 234-245 ◽  
Author(s):  
Frank Drewes
Keyword(s):  
Top Down ◽  
Tree Transducers

PROPERTIES OF QUASI-RELABELING TREE BIMORPHISMS

2010 ◽  
Vol 21 (03) ◽  
pp. 257-276 ◽  
Author(s):  
ANDREAS MALETTI ◽  
CĂTĂLIN IONUŢ TÎRNĂUCĂ
Keyword(s):  
Cartesian Product ◽  
Canonical Representation ◽  
Finite Union ◽  
Top Down ◽  
Tree Language ◽  
Regular Tree ◽  
Fundamental Properties ◽  
Tree Transducers ◽  
Tree Languages ◽  
Context Free

The fundamental properties of the class QUASI of quasi-relabeling relations are investigated. A quasi-relabeling relation is a tree relation that is defined by a tree bimorphism (φ, L, ψ), where φ and ψ are quasi-relabeling tree homomorphisms and L is a regular tree language. Such relations admit a canonical representation, which immediately also yields that QUASI is closed under finite union. However, QUASI is not closed under intersection and complement. In addition, many standard relations on trees (e.g., branches, subtrees, v-product, v-quotient, and f-top-catenation) are not quasi-relabeling relations. If quasi-relabeling relations are considered as string relations (by taking the yields of the trees), then every Cartesian product of two context-free string languages is a quasi-relabeling relation. Finally, the connections between quasi-relabeling relations, alphabetic relations, and classes of tree relations defined by several types of top-down tree transducers are presented. These connections yield that quasi-relabeling relations preserve the regular and algebraic tree languages.

scholarly journals Deterministic top-down tree transducers with iterated look-ahead

1995 ◽  
Vol 143 (2) ◽  
pp. 285-308 ◽  
Author(s):  
Giora Slutzki ◽  
Sándor Vágvölgyi
Keyword(s):  
Top Down ◽  
Look Ahead ◽  
Tree Transducers

Variants of top-down tree transducers with look-ahead

1988 ◽  
Vol 21 (1) ◽  
pp. 125-145 ◽  
Author(s):  
Zoltán Fülöp ◽  
Sándor Vágvölgyi
Keyword(s):  
Top Down ◽  
Look Ahead ◽  
Tree Transducers

scholarly journals Top-down tree transducers with regular look-ahead

1975 ◽  
Vol 4 (49) ◽  
Author(s):  
Joost Engelfriet
Keyword(s):  
Top Down ◽  
Closure Properties ◽  
Look Ahead ◽  
Tree Transducers ◽  
Tree Transformation

Top-down tree transducers with regular look-ahead are introduced. It is shown how these can be decomposed and composed, and how this leads to closure properties of surface sets and tree transformation languages. Particular attention is paid to deterministic tree transducers.

scholarly journals Shape preserving top-down tree transducers

2003 ◽  
Vol 304 (1-3) ◽  
pp. 315-339 ◽  
Author(s):  
Zoltán Fülöp ◽  
Zsolt Gazdag
Keyword(s):  
Top Down ◽  
Shape Preserving ◽  
Tree Transducers

scholarly journals Top-down tree transducers with regular look-ahead

1976 ◽  
Vol 10 (1) ◽  
pp. 289-303 ◽  
Author(s):  
Joost Engelfriet
Keyword(s):  
Top Down ◽  
Look Ahead ◽  
Tree Transducers

scholarly journals Look-ahead removal for total deterministic top-down tree transducers

2016 ◽  
Vol 616 ◽  
pp. 18-58 ◽  
Author(s):  
Joost Engelfriet ◽  
Sebastian Maneth ◽  
Helmut Seidl
Keyword(s):  
Top Down ◽  
Look Ahead ◽  
Tree Transducers
Sign in / Sign up

Export Citation Format

Share Document