Equivalence of Deterministic Top-Down Tree-to-String Transducers is Decidable

Helmut Seidl, Sebastian Maneth, Gregor Kemper. Equivalence of Deterministic Top-Down Tree-to-String Transducers is Decidable. In Venkatesan Guruswami, editor, IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015. pages 943-962, IEEE, 2015. [doi]

Abstract

Abstract is missing.