Variants of top-down tree transducers with look-ahead
In this article we consider deterministic and strongly deterministic top-down tree transducers with regular look-ahead, with regular check, with deterministic top-down look-ahead, and with deterministic top-down check. We compare the transformational power of these tree transducer classes by giving a correct inclusion diagram of the tree transformation classes induced by them. Along with the comparison we decompose some of the examined classes into simpler classes and we introduce the concept of the deterministic top-down tree automata with deterministic top-down look-ahead. We show that these recognizers recognize a tree language class which is strictly between the class of regular tree languages and the class of tree languages recognizable by deterministic top-down tree automata. We also study the closure properties of the examined tree transformation classes. We show that some classes are closed under composition while others, for example the class of tree transformations induced by deterministic top-down tree transducers with deterministic top-down look-ahead, are not.
KeywordsFunction Symbol Closure Property Input Tree Tree Automaton Tree Language
Unable to display preview. Download preview PDF.
- Z. Fülöp and S. Vágvölgyi, Top-down tree transducers with deterministic top-down look-ahead, submitted for publication.Google Scholar