Some Remarks on Deciding Equivalence for Graph-To-Graph Transducers
Mikołaj Bojańczyk, Janusz Schmude · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2020
We study the following decision problem: given two mso transductions that input and output graphs of bounded treewidth, decide if they are equivalent, i.e. isomorphic inputs give isomorphic outputs. We do not know how to decide it, but we propose an approach that uses automata manipulating elements of a ring extended with division. The approach works for a variant of the problem, where isomorphism on output graphs is replaced by a relaxation of isomorphism.