String Languages Generated by Total Deterministic Macro Tree Transducers
نویسنده
چکیده
The class of string languages obtained by taking the yields of output tree languages of total deterministic macro tree transducers (MTTs) is investigated. The rst main result is that MTTs which are linear and nondeleting in the parameters generate the same class of string languages as total deterministic top-down tree transducers. The second main result is a so called \bridge theorem"; it can be used to show that there is a string language generated by a nondeterministic top-down tree transducer with monadic input, i.e., an ET0L language, which cannot be generated by an MTT. In fact, it is shown that this language cannot even be generated by the composition closure of MTTs; hence it is also not in the IO-hierarchy.
منابع مشابه
Output String Languages of Compositions of Deterministic Macro Tree Transducers
The composition of total deterministic macro tree transducers gives rise to a proper hierarchy with respect to their output string languages (these are the languages obtained by taking the yields of the output trees). There is a language not in this hierarchy which can be generated by a (quite restricted) nondeterministic string transducer, namely, a two-way generalized sequential machine. Simi...
متن کاملPushdown Machines for the Macro Tree Transducer
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 transducers (macro tree-to-string transducers, respectively). For this purpose we define several pushdown...
متن کاملLinear Context-Free Rewriting Systems and Deterministic Tree-Walking Transducers
I n t r o d u c t i o n In [9] a comparison was made of the generative capacity of a number of grammar formalisms. Several were found to share a number of characteristics (described below) and the class of such formalisms was called linear context-free rewriting systems. This paper shows how the class of string languages generated by linear context-free rewriting systems relates to a number of ...
متن کاملDecision Problems of Tree Transducers with Origin
A tree transducer with origin translates an input tree into a pair of output tree and origin info. The origin info maps each node in the output tree to the unique input node that created it. In this way, the implementation of the transducer becomes part of its semantics. We show that the landscape of decidable properties changes drastically when origin info is added. For instance, equivalence o...
متن کامل