The Equivalence Problem for Deterministic MSO Tree Transducers is   Decidable
  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. 
Joost Engelfriet and Sebastian Maneth