Shape preserving top-down tree transducers

Authors:
Zoltán Fülöp;Zsolt Gazdag
Affiliations:
Department of Computer Science, University of Szeged, Árpád tér 2., H-6720 Szeged, Hungary;Department of Computer Science, University of Szeged, Árpád tér 2., H-6720 Szeged, Hungary
Venue:
Theoretical Computer Science
Year:
2003

Citing 4
Cited 1

Tree languages

Handbook of formal languages, vol. 3
Automata, Languages, and Machines

Automata, Languages, and Machines
Iterated relabeling tree transducers

Theoretical Computer Science
Iterated Length-Preserving Rational Transductions

MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science

Shape preserving bottom-up tree transducers

Journal of Automata, Languages and Combinatorics

Quantified Score

Hi-index	5.23

Visualization

Abstract

As top-down tree transducers generalize generalized sequential machines, shape preserving top-down tree transducers naturally generalize length preserving generalized sequential machines. For instance, top-down relabeling tree transducers are shape preserving top-down tree transducers. We show that a top-down tree transducer is shape preserving if and only if it is equivalent to a top-down relabeling tree transducer. We also prove that it is decidable if a top-down tree transducer is shape preserving.