2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/32806It 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.Logic in Computer Sciencetext