Dice Question Streamline Icon: https://streamlinehq.com

Decidability of equivalence for deterministic attributed tree transducers

Establish the decidability of the equivalence problem for deterministic attributed tree transducers; that is, given two deterministic attributed tree transducers, decide whether they realize the same tree translation.

Information Square Streamline Icon: https://streamlinehq.com

Background

The authors point out that proving decidability of functionality for a single attributed tree transducer would imply decidability of equivalence for deterministic attributed tree transducers.

They explicitly identify the equivalence problem for deterministic attributed tree transducers as a longstanding open problem in the area.

References

Note that decidability of the latter would imply that equivalence of deterministic attributed tree transducers is decidable. The latter is a long standing open problem.

— Attributed Tree Transducers for Partial Functions (2406.06141 - Maneth et al., 10 Jun 2024) in Section 8 (Conclusion)