A complete description for a monoid of deterministic bottom-up tree transformation classes
Theoretical Computer Science
Compositions of deterministic bottom-up, top-down, and regular look-ahead tree transformations
Theoretical Computer Science
Handbook of formal languages, vol. 3
Handbook of formal languages, vol. 3
The equivalence of bottom-up and top-down tree-to-graph transducers
Journal of Computer and System Sciences
Macro tree transducers, attribute grammars, and MSO definable tree translations
Information and Computation
A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead
Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
Compositions of extended top-down tree transducers
Information and Computation
Extended Multi Bottom-Up Tree Transducers
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Compositions of top-down tree transducers with ε-rules
FSMNLP'09 Proceedings of the 8th international conference on Finite-state methods and natural language processing
Tree transformations and dependencies
MOL'11 Proceedings of the 12th biennial conference on The mathematics of language
Survey: Weighted Extended Top-down Tree Transducers Part II—Application in Machine Translation
Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
| Hi-index | 5.24 |
In general, top-down and bottom-up tree transducers lead to incomparable classes of tree transformations, both for the nondeterministic and the deterministic case. If deterministic top-down tree transducers are extended by the capability to recognize regular tree properties and deterministic bottom-up tree transducers are generalized by allowing states with arbitrary finite rank, then the two devices, now called deterministic top-down tree transducers with regular look-ahead and deterministic multi bottom-up tree transducers, respectively, become equivalent [Z. Fülöp, A. Kühnemann, H. Vogler, A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead, Inform. Process. Lett. 91 (2004) 57-67].In this paper we focus on the class ld-MBOT of tree transformations which are computed by linear deterministic multi bottom-up tree transducers. We investigate the relationship among ld-MBOT and the classes of tree transformations computed by (restricted) deterministic bottom-up tree transducers and by (restricted) deterministic top-down tree transducers with regular look-ahead. In fact, we show the inclusion diagram of nine such classes.