Results 1 - 10 of 66

The Complexity of Translation Membership for Macro Tree Transducers

by Kazuhiro Inaba, Sebastian Maneth , 2009
"... Macro tree transducers (mtts) are a useful formal model for XML query and transformation languages. In this paper one of the fundamental decision problems on translations, namely the “translation membership problem ” is studied for mtts. For a fixed translation, the translation membership problem as ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
Macro tree transducers (mtts) are a useful formal model for XML query and transformation languages. In this paper one of the fundamental decision problems on translations, namely the “translation membership problem ” is studied for mtts. For a fixed translation, the translation membership problem

Macro tree transducers in Treebag

by Karl Azab , 2005
"... Treebag is a software for experimenting with formal models in Computer Science, one type of such models being tree transducers. Tree transducers translate input trees to output trees, a mechanism used in e.g. compilers and picture generation. The top-down tree transducer is one of the formal models ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Treebag is a software for experimenting with formal models in Computer Science, one type of such models being tree transducers. Tree transducers translate input trees to output trees, a mechanism used in e.g. compilers and picture generation. The top-down tree transducer is one of the formal models

Macro Tree Transducers, Attribute Grammars, and MSO Definable Tree Translations

by Joost Engelfriet, Sebastian Maneth - Inform. and Comput , 1998
"... A characterization is given of the class of tree translations definable in monadic second order logic (MSO), in terms of macro tree transducers. The first main result is that the MSO definable tree translations are exactly those tree translations realized by macro tree transducers (MTTs) with reg ..."
Abstract - Cited by 58 (23 self) - Add to MetaCart
A characterization is given of the class of tree translations definable in monadic second order logic (MSO), in terms of macro tree transducers. The first main result is that the MSO definable tree translations are exactly those tree translations realized by macro tree transducers (MTTs

The Complexity of Compositions of Deterministic Tree Transducers

by Sebastian Maneth - Proceedings of the 22nd Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2002), volume 2556 of LNCS , 2002
"... Macro tree transducers can simulate most models of tree transducers (e.g., top-down and bottom-up tree transducers, attribute grammars, and pebble tree transducers which, in turn, can simulate all known models of XML transformers). The string languages generated by compositions of macro tree transdu ..."
Abstract - Cited by 13 (6 self) - Add to MetaCart
transducers (obtained by reading the leaves of the output trees) form a large class which contains, e.g., the IO hierarchy and the EDT0L control hierarchy. Consider an arbitrary composition of (deterministic) macro tree transducers. How dicffiult is it, for a given input tree s, to compute the translation

XML type checking with macro tree transducers

by S. Maneth, A. Berlea, T. Perst, H. Seidl , 2004
"... The tree transformation language tl is introduced which incorporates full MSO-pattern-matching, arbitrary navigation through the input, and named procedures with accumulating parameters. Thus, tl essentially captures all features offered by existing document processing languages such as Xslt, fxt, ..."
Abstract - Cited by 61 (9 self) - Add to MetaCart
, or XDuce. It is proved that tl, despite its expressiveness, still allows for effective inverse type inference. This result is obtained by means of a translation of tl transformers into compositions of (stay) macro tree transducers.

PUSHDOWN MACHINES FOR THE MACRO TREE transducer

by Joost Engelfriet, Heiko Vogler , 1986
"... The macro tree transducer can be considered as a system of recursive function procedures with parameters, where the recursion is on a tree (e.g., the syntax tree of a program). We investigate characterizations of the class of tree (tree-to-string) translations which is induced by macro tree transd ..."
Abstract - Cited by 17 (9 self) - Add to MetaCart
The macro tree transducer can be considered as a system of recursive function procedures with parameters, where the recursion is on a tree (e.g., the syntax tree of a program). We investigate characterizations of the class of tree (tree-to-string) translations which is induced by macro tree

Macro Forest Transducers

by Thomas Perst, Helmut Seidl - Information Processing Letters , 2004
"... Abstract Xml documents conceptually are not trees, but forests. Therefore, we extend the concept of macro tree transducers (mtt’s) to a transformation formalism of forests, macro forest transducers (mft’s). We show that mft’s form a strict superset of mtt’s operating on forests (represented as binar ..."
Abstract - Cited by 35 (2 self) - Add to MetaCart
as binary trees). On the other hand, the transformation of every mft can be simulated by the composition of two mtt’s. Although macro for-est transducers are more powerful, the complexity of inverse type inference, i.e., computing the pre-image of a recognizable language, is almost the same as for tree

A comparison of pebble tree transducers with macro tree transducers

by Joost Engelfriet, Sebastian Maneth - Acta Informatica , 2003
"... Abstract. The n-pebble tree transducer was recently proposed as a model for XML query languages. The four main results on deterministic transducers are: First, (1) the translation τ of an n-pebble tree transducer can be realized by a composition of n + 1 0-pebble tree transducers. Next, the pebble t ..."
Abstract - Cited by 43 (11 self) - Add to MetaCart
Abstract. The n-pebble tree transducer was recently proposed as a model for XML query languages. The four main results on deterministic transducers are: First, (1) the translation τ of an n-pebble tree transducer can be realized by a composition of n + 1 0-pebble tree transducers. Next, the pebble

Macro forrest transducers

by Thomas Perst, et al.
"... Xml documents conceptually are not trees, but forests. Therefore, we extend the concept of macro tree transducers (mtt's) to a transformation formalism of forests, macro forest transducers (mft's). We show that mft's form a strict superset of mtt's operating on forests (represe ..."
Abstract - Add to MetaCart
(represented as binary trees). On the other hand, the transformation of every mft can be simulated by the composition of two mtt's. Although macro forest transducers are more powerful, the complexity of inverse type inference, i.e., computing the pre-image of a recognizable language, is almost the same

On Minimalist Attribute Grammars and Macro Tree Transducers

by Jens Michaelis, Uwe Mönnich, Frank Morawietz - Linguistic Form and its Computation
"... In this paper we extend the work by Michaelis (1999) which shows how to encode an arbitrary Minimalist Grammar in the sense of Stabler (1997) into a weakly equivalent multiple contextfree grammar (MCFG). By viewing MCFG-rules as terms in a free Lawvere theory we can translate a given MCFG into a ..."
Abstract - Cited by 11 (4 self) - Add to MetaCart
-walking automata and through a macro tree transduction. This two-step approach gives an operational as well as a logical description of the tree sets involved. As an interlude we show that MCFGs can be regarded as a particularly simple attribute grammar. 1 Introduction Algebraic, logical and regular
Results 1 - 10 of 66