Esparza J.

Fülöp Z.

Ginsburg S.

Sebastian Maneth

Zachar Z.

Ésik Z.

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.</jats:p

Crossref

International Journal of Foundations of Computer Science

A Survey on Decidable Equivalence Problems for Tree Transducers

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

Maneth, Sebastian

Edinburgh Research Explorer

https://www.pure.ed.ac.uk/ws/files/25073983/survey_1.pdf

A Survey on Decidable Equivalence Problems for Tree Transducers

Abstract

Similar works

Full text

Available Versions

Crossref

Edinburgh Research Explorer