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.

中文翻译：

---

具有自由组中输出的线性树传感器的等效性

我们表明，当在自由组上解释其输出时，可以在多项式时间内确定确定性线性树传感器的等效性。由于自由组提供的抵消特性，所需的构造不仅更通用，而且比用于证明确定性线性树到词转换器的等效性的相应构造更简单。