A Survey on Decidable Equivalence Problems for Tree Transducers

  title={A Survey on Decidable Equivalence Problems for Tree Transducers},
  author={Sebastian Maneth},
  journal={Int. J. Found. Comput. Sci.},
  • S. Maneth
  • Published 1 December 2015
  • Computer Science
  • Int. J. Found. Comput. Sci.
The decidability of equivalence for three important classes of tree transducers is discussed. Each class can be obtained as a natural restriction of deterministic macro tree transducers (MTTs): (1) no context parameters, i.e., top-down tree transducers, (2) linear size increase, i.e., MSO definable tree transducers, and (3) monadic input and output ranked alphabets. For the full class of mtts, decidability of equivalence remains a long-standing open problem. 

Figures from this paper

Equivalence of Deterministic Top-Down Tree-to-String Transducers is Decidable
We show that equivalence of deterministic top-down tree-to-string transducers is decidable, thus solving a long standing open problem in formal language theory. We also present efficient algorithms
Definability Results for Top-Down Tree Transducers
We prove that for a given deterministic top-down transducer with look-ahead it is decidable whether or not its translation is definable (1) by a linear top-down tree transducer or (2) by a tree
Reducing Transducer Equivalence to Register Automata Problems Solved by "Hilbert Method"
This paper reduces macro tree transducers equivalence to an equivalence problem for some class of register automata naturally relevant to the method, and proves this latter problem to be undecidable.
Deciding Equivalence of Separated Non-Nested Attribute Systems in Polynomial Time
A new alternative decision procedure for deciding equivalence of transducer in the latter class is presented and it is proved that it runs in polynomial time.
Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity
It is proved that any composition of tree-walking tree transducers can be realized as a linear-bounded composition, which means that the sizes of the intermediate results can be chosen to be at most linear in the size of the output tree.
Transducers, logic and algebra for functions of finite words
This paper considers two important classes of word functions, the rational and regular functions, respectively defined by one-way and two-way automata with output words, called transducers.
Normalization and Learning of Transducers on Trees and Words. (Normalisation et Apprentissage de Transducteurs d'Arbres et de Mots)
A new normal form is proposed for deterministic top-down tree transducers which provides a compromise between lookahead and state minimization, that leads to a learning algorithm in Gold’s learning model with polynomial resources.


Single-Valuedness of Tree Transducers is Decidable in Polynomial Time
  • H. Seidl
  • Computer Science, Mathematics
    Theor. Comput. Sci.
  • 1992
On normalization and type checking for tree transducers
It is shown that type checking of tree walking transducers can be performed in polynomial time, if the output type is specified by a deterministic tree automaton and the transducer visits every input node only a bounded number of times.
Decidability results concerning tree transducers I
  • Z. Ésik
  • Computer Science, Mathematics
    Acta Cybern.
  • 1980
A tree transducer is called functional if its induced transformation is a partial mapping. We show that the functionality of tree transducers is decidable. Consequently, the equivalence problem for
Earliest Normal Form and Minimization for Bottom-up Tree Transducers
It is shown that for every deterministic bottom-up tree transducer, a unique equivalent transducers can be constructed which is minimal, based on a sequence of normalizing transformations which guarantee that non-trivial output is produced as early as possible.
The Equivalence Problem for Deterministic MSO Tree Transducers Is Decidable
Deciding equivalence of top-down XML transformations in polynomial time
The equivalence problem for deterministic two-way sequential transducers is decidable
  • E. Gurari
  • Mathematics
    21st Annual Symposium on Foundations of Computer Science (sfcs 1980)
  • 1980
The equivalence problem for deterministic twoway sequential transducers is shown to be decidable also for the general case, even when the devices are allowed to make some finite number of nondeterministic moves.
On the Equivalence Problem for Letter-to-Letter Top-Down Tree Transducers
The Macro Tree Transducer Hierarchy Collapses for Functions of Linear Size Increase
Every composition of macro tree transducers that is a function of linear size increase can be realized by just one macro tree transducer. For a given composition it is decidable whether or not it is
Output String Languages of Compositions of Deterministic Macro Tree Transducers
Results hold for attributed tree transducers, for controlled EDT0L systems, and for YIELD mappings (which proves properness of the IO-hierarchy).