Decision problems for origin-close top-down tree transducers (full version)

  title={Decision problems for origin-close top-down tree transducers (full version)},
  author={Sarah Winter},
Abstract Tree transductions are binary relations of finite trees. For tree transductions defined by nondeterministic top-down tree transducers, inclusion, equivalence and synthesis problems are known to be undecidable. Adding origin semantics to tree transductions, i.e., tagging each output node with the input node it originates from, is a known way to recover decidability for inclusion and equivalence. The origin semantics is rather rigid, in this work, we introduce a similarity measure for… Expand

Figures from this paper


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. Expand
Synthesis of Deterministic Top-down Tree Transducers from Automatic Tree Relations
This paper considers the synthesis of deterministic tree transducers from automaton definable specifications, given as binary relations, over finite trees, and provides decision procedures for both bounded and arbitrary delay that yield deterministic top-down tree trans producers which realize the specification for valid input trees. Expand
Uniformization Problems for Tree-Automatic Relations and Top-Down Tree Transducers
It is shown that it becomes undecidable for general tree-automatic relations (specified by non-deterministic top-down tree automata) and two cases for which the problem remains decidable. Expand
The Power of Extended Top-Down Tree Transducers
The obtained properties completely explain the Hasse diagram of the induced classes of tree transformations and it is shown that most interesting classes of transformations computed by extended top-down tree transducers are not closed under composition. Expand
Decidability results concerning tree transducers I
  • Z. Ésik
  • Computer Science
  • 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 forExpand
Look-ahead removal for total deterministic top-down tree transducers
A restricted class of transducers with look-ahead, namely those that are total, deterministic, ultralinear, and bounded erasing, is presented, which assumes that a so-called difference bound is known for the given transducer. Expand
Origin-equivalence of two-way word transducers is in PSPACE
It is proved that decidability can be equally recovered by adopting a slightly different, but natural semantics, called origin semantics, and introduced by Bojanczyk in 2014. Expand
On Equivalence and Uniformisation Problems for Finite Transducers
This paper investigates stronger variants of inclusion, equivalence and sequential uniformisation, based on a general notion of transducer resynchronisation, and shows their decidability. Expand
Macro Tree Translations of Linear Size Increase are MSO Definable
The first main result is that if a macro tree translation is of linear size increase, then the translation is MSO definable (i.e., definable in monadic second-order logic) and if it is, then an equivalent MSO transducer can be constructed. Expand
Transducers with Origin Information
This paper proposes to treat origin information as part of the semantics of a regular string-to-string function, which admits a machine-independent characterisation, Angluin-style learning in polynomial time, as well as effective characterisations of natural subclasses such as one-way transducers or first-order definable transducers. Expand