Equivalence Problems for Tree Transducers: A Brief Survey
Formal Languages and Automata Theory
2014-05-23 v1
Abstract
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.
Cite
@article{arxiv.1405.5597,
title = {Equivalence Problems for Tree Transducers: A Brief Survey},
author = {Sebastian Maneth},
journal= {arXiv preprint arXiv:1405.5597},
year = {2014}
}
Comments
In Proceedings AFL 2014, arXiv:1405.5272