Equivalence of Linear Tree Transducers with Output in the Free Group
Formal Languages and Automata Theory
2020-03-16 v2
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
Cite
@article{arxiv.2001.03480,
title = {Equivalence of Linear Tree Transducers with Output in the Free Group},
author = {Raphaela Löbel and Michael Luttenberger and Helmut Seidl},
journal= {arXiv preprint arXiv:2001.03480},
year = {2020}
}
Comments
Minor changes based on some reviews. A short version of this paper will be published in the proceedings of DLT 2020