Equivalence Problems for Tree Transducers: A Brief Survey

  title={Equivalence Problems for Tree Transducers: A Brief Survey},
  author={Sebastian Maneth},
  • S. Maneth
  • Published in AFL 21 May 2014
  • Computer Science
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
A Mechanized Theory of Regular Trees in Dependent Type Theory
This paper describes an implementation of regular trees in dependent type theory, semantically characterised as a coinductive type and syntactically as a nested datatype, and shows how tree transducers can be used to define regular tree homomorphisms by guarded corecursion.
Equivalence of Symbolic Tree Transducers
The equivalence problem of deterministic symbolic top-down tree transducers (DTop) can be reduced to that of classical DTop and the equivalence of two symbolic DTop can be decided in NExpTime, when assuming that all operations related to the processing of data values are in PTime.
Decision Problems of Tree Transducers with Origin
The landscape of decidable properties changes drastically when origin info is added, and it is shown that equivalence of nondeterministic top-down and MSO transducers with origin is decidable.
Determinacy and rewriting of functional top-down and MSO tree transformations
Two-way pebble transducers for partial functions and their composition
Two-way finite state transducers are considered that use a finite number of pebbles, of which the life times must be nested, and the composition of two deterministic transducers can be realized by one such transducer with a minimal number ofpebbles.
Equivalence - Combinatorics, Algebra, Proofs
Algorithmics on SLP-comp compressed Strings: a Survey and Parameter Reduction and Automata Evaluation for Grammar-compressed Trees.
Square on Ideal, Closed and Free Languages
Tight upper bounds are obtained on optimal alphabets for prefix-closed, xsided-ideal and xfix-free languages, except for suffix-free, where a ternary alphabet is used.
Logic-Automata Connections for Transformations
This paper is a survey of known automata-logic connections for transformations of words and trees.


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.
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.
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
On the Equivalence Problem for Letter-to-Letter Top-Down Tree Transducers
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).
Deciding equivalence of top-down XML transformations in polynomial time
Streaming Tree Transducers
Streaming tree transducers is introduced as an analyzable, executable, and expressive model for transforming unranked ordered trees (and forests) in a single pass and it is proved that the expressiveness of the model coincides with transductions definable using monadic second-order logic (MSO).
Macro 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