The Equivalence Problem for Deterministic MSO Tree Transducers is Decidable
Joost Engelfriet, Sebastian Maneth
TL;DR
This paper proves that it is decidable to determine whether two deterministic MSO transducers produce the same output on all graphs within a context-free set, advancing understanding of their equivalence.
Contribution
It establishes the decidability of the equivalence problem for deterministic MSO graph transducers on context-free graph sets.
Findings
Decidability of equivalence for deterministic MSO transducers.
Applicable to graph-to-string and graph-to-tree transductions.
Operates on context-free graph sets.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · DNA and Biological Computing · Computability, Logic, AI Algorithms