On Injectivity of Deterministic Top-Down Tree Transducers

Abstract We give a simple proof for the decidability of injectivity of linear deterministic top–down tree transducers. Moreover, we show that injectivity is undecidable even for homomorphism tree transducers.

[1]  Sándor Vágvölgyi,et al.  Tree Transducers with External Functions , 1993, Theor. Comput. Sci..

[2]  Joost Engelfriet,et al.  Macro Tree Transducers , 1985, J. Comput. Syst. Sci..