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]
@inproceedings{SeidlMK15,
title = {Equivalence of Deterministic Top-Down Tree-to-String Transducers is Decidable},
author = {Helmut Seidl and Sebastian Maneth and Gregor Kemper},
year = {2015},
doi = {10.1109/FOCS.2015.62},
url = {http://dx.doi.org/10.1109/FOCS.2015.62},
researchr = {https://researchr.org/publication/SeidlMK15},
cites = {0},
citedby = {0},
pages = {943-962},
booktitle = {IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015},
editor = {Venkatesan Guruswami},
publisher = {IEEE},
isbn = {978-1-4673-8191-8},
}