Two complexity results are shown for the output languages generated by compositions of macro tree transducers. They are in $NSPACE(n)$ and hence are context-sensitive, and the class is NP-complete
AbstractA characterization is given of the class of tree translations definable in monadic second-or...
Abstract. The n-pebble tree transducer was recently proposed as a model for XML query languages. The...
We develop intercalation lemmas for the computations of the top-down tree transducers defined by Rou...
Compositions of tree-walking tree transducers form a hierarchy with respect to the number of transdu...
Compositions of tree-walking tree transducers form a hierarchy with respect to the number of transdu...
AbstractThe composition of total deterministic macro tree transducers gives rise to a proper hierarc...
AbstractThe exponential output size problem is to determine whether the size of output trees of a tr...
AbstractMacro tree transducers are a combination of top-down tree transducers and macro grammars. Th...
AbstractThe size of an accepting computation tree of an alternating Turing machine (ATM) is introduc...
AbstractThe size of an accepting computation tree of an alternating Turing machine (ATM) is introduc...
AbstractThe concept of basic tree transducer is investigated; it is obtained as a natural restrictio...
The formalized and algorithmic study of human language within the field of Natural Language Processi...
The formalized and algorithmic study of human language within the field of Natural Language Processi...
The formalized and algorithmic study of human language within the field of Natural Language Processi...
The formalized and algorithmic study of human language within the field of Natural Language Processi...
AbstractA characterization is given of the class of tree translations definable in monadic second-or...
Abstract. The n-pebble tree transducer was recently proposed as a model for XML query languages. The...
We develop intercalation lemmas for the computations of the top-down tree transducers defined by Rou...
Compositions of tree-walking tree transducers form a hierarchy with respect to the number of transdu...
Compositions of tree-walking tree transducers form a hierarchy with respect to the number of transdu...
AbstractThe composition of total deterministic macro tree transducers gives rise to a proper hierarc...
AbstractThe exponential output size problem is to determine whether the size of output trees of a tr...
AbstractMacro tree transducers are a combination of top-down tree transducers and macro grammars. Th...
AbstractThe size of an accepting computation tree of an alternating Turing machine (ATM) is introduc...
AbstractThe size of an accepting computation tree of an alternating Turing machine (ATM) is introduc...
AbstractThe concept of basic tree transducer is investigated; it is obtained as a natural restrictio...
The formalized and algorithmic study of human language within the field of Natural Language Processi...
The formalized and algorithmic study of human language within the field of Natural Language Processi...
The formalized and algorithmic study of human language within the field of Natural Language Processi...
The formalized and algorithmic study of human language within the field of Natural Language Processi...
AbstractA characterization is given of the class of tree translations definable in monadic second-or...
Abstract. The n-pebble tree transducer was recently proposed as a model for XML query languages. The...
We develop intercalation lemmas for the computations of the top-down tree transducers defined by Rou...
DOI
Add to ORKG