Abstract
The top-down and bottom-up tree transducer are incomparable with respect to their transformation power. The difference between them is mainly caused by the different order in which they use the facilities of copying and nondeterminism. One can however define certain simple tree transformations, independent of the top-down/bottom-up distinction, such that each tree transformation, top-down or bottom-up, can be decomposed into a number of these simple transformations. This decomposition result is used to give simple proofs of composition results concerning bottom-up tree transformations.
A new tree transformation model is introduced which generalizes both the top-down and the bottom-up tree transducer.
Original language | Undefined |
---|---|
Pages (from-to) | 198-231 |
Journal | Mathematical systems theory |
Volume | 9 |
Issue number | 2 |
DOIs | |
Publication status | Published - 1975 |
Keywords
- IR-85444