Undecidable properties of deterministic top-down tree transducers

Z. Fülöp
1994 Theoretical Computer Science  
Fiil(ip, Z., Undecidable properties of deterministic top-down tree transducers, Theoretical Computer Science 134 (1994) 311-328. Decidability questions concerning ranges of deterministic top-down tree transducers are considered. It is shown that the following nine problems are undecidable, for ranges L1 a of arbitrary two deterministic, nondeleting and finite copying top-down tree transducers: I Correspondence to: Z. Fiiliip,
doi:10.1016/0304-3975(94)90241-0 fatcat:2r7kg7caibcfddv7gzbvqlsczq