par Filiot, Emmanuel ;Maneth, Sebastian;Reynier, Pierre-Alain ;Talbot, Jean-Marc
Référence Lecture notes in computer science, 9135, page (209--221)
Publication Publié, 2015-06-01
Article révisé par les pairs
Résumé : A tree transducer with origin translates an input tree into a pair of output tree and origin info. The origin info maps each node in the output tree to the unique input node that created it. In this way, the implementation of the transducer becomes part of its semantics. We show that the landscape of decidable properties changes drastically when origin info is added. For instance, equivalence of nondeterministic top-down and MSO transducers with origin is decidable. Both problems are undecidable without origin. The equivalence of deterministic topdown tree-to-string transducers is decidable with origin, while without origin it is a long standing open problem. With origin, we can decide if a deterministic macro tree transducer can be realized by a deterministic top-down tree transducer; without origin this is an open problem.