@inproceedings{f162b78155724844a71abdaddd94d06c,
title = "Equivalence of Linear Tree Transducers with Output in the Free Group",
abstract = "We show that equivalence of deterministic linear tree transducers can be decided in polynomial time when their outputs are interpreted over the free group. Due to the cancellation properties offered by the free group, the required constructions are not only more general, but also simpler than the corresponding constructions for proving equivalence of deterministic linear tree-to-word transducers.",
keywords = "Equivalence problem, Free group, Linear tree transducer, Polynomial time",
author = "Raphaela L{\"o}bel and Michael Luttenberger and Helmut Seidl",
note = "Publisher Copyright: {\textcopyright} Springer Nature Switzerland AG 2020.; 24th International Conference on Developments in Language Theory, DLT 2020 ; Conference date: 11-05-2020 Through 15-05-2020",
year = "2020",
doi = "10.1007/978-3-030-48516-0_16",
language = "English",
isbn = "9783030485153",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer",
pages = "207--221",
editor = "Nata{\v s}a Jonoska and Dmytro Savchuk",
booktitle = "Developments in Language Theory - 24th International Conference, DLT 2020, Proceedings",
}