The Equivalence Problem for Deterministic MSO Tree Transducers is Decidable
Logic in Computer Science
2007-05-23 v1
Abstract
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.
Keywords
Cite
@article{arxiv.cs/0506014,
title = {The Equivalence Problem for Deterministic MSO Tree Transducers is Decidable},
author = {Joost Engelfriet and Sebastian Maneth},
journal= {arXiv preprint arXiv:cs/0506014},
year = {2007}
}