Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9657709 | Theoretical Computer Science | 2005 | 12 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Zoltán Fülöp, Armin Kühnemann, Heiko Vogler,