most citedThe Kernel Polynomial Method

1.1k citations

researchers with a paper here
collaborating institutions
Showing cs.LOShow all

1 paper · 1 filter

cs.LO2005★ 3 cited

The Equivalence Problem for Deterministic MSO Tree Transducers is Decidable

Joost Engelfriet, Sebastian Maneth

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.