The Equivalence Problem for Deterministic MSO Tree Transducers is Decidable
classification
💻 cs.LO
keywords
decidabledeterministictransducerscontext-freedefinableequivalenceequivalentgraph-to-string
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.