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

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Helmut Seidl' in GoogleThis author has not been identified. It may be one of the following persons:

Sebastian Maneth

Look up 'Sebastian Maneth' in GoogleThis author has not been identified. Look up 'Gregor Kemper' in Google

runs on WebDSL