The Equivalence Problem for Deterministic MSO Tree Transducers is Decidable
<|reference_start|>The Equivalence Problem for Deterministic MSO Tree Transducers is Decidable: It is decidable for deterministic MSO definable graph-to-string or graph-to-tree transducers whether they are equivalent on a context-free set of graphs.<|reference_end|>
@article{engelfriet2005the,
    title={The Equivalence Problem for Deterministic MSO Tree Transducers is
  Decidable},
    author={Joost Engelfriet and Sebastian Maneth},
    journal={arXiv preprint arXiv:cs/0506014},
    year={2005},
    archivePrefix={arXiv},
    eprint={cs/0506014},
    primaryClass={cs.LO}
}