Automata, Languages, and Machines
Automata, Languages, and Machines
Iterated relabeling tree transducers
Theoretical Computer Science
Decidability of Equivalence for Linear Letter to Letter To-down Tree Transducers
FCT '93 Proceedings of the 9th International Symposium on Fundamentals of Computation Theory
Iterated Length-Preserving Rational Transductions
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Shape preserving top-down tree transducers
Theoretical Computer Science
| Hi-index | 0.00 |
It is easy to observe that both top-down and bottom-up (finite state) relabelling tree transducers preserve the shape of the trees. It is known that every shape preserving top-down tree transducer is semantically equivalent to a top-down relabelling tree transducer. In this way, for top-down tree transducers, the semantic property "being shape preserving" is characterized by the syntactic property "being relabelling". In this paper we prove the analogous result for bottom-up tree transducers. Namely, we show that every shape preserving bottom-up tree transducer is equivalent to a bottom-up relabelling tree transducer. We also prove that it is decidable if two shape preserving bottom-up tree transducers are equivalent.