Deterministic bottom-up tree transducers and ground term rewrite systems
We show that it is decidable for any deterministic bottom-up tree transducer A and ground term rewrite system R, which one of the following conditions holds: (i) tau(A) subset of  (R)*, (ii)  (R)* subset of tau(A), (iii) tau(A) =  (R)*, (iv) tau(A) and  (R)* are incomparable. Here tau(A) is the tree transformation induced by A, and  (R)* is the congruence generated by R. (C) 2009 Elsevier B.V. All rights reserved.
bottom-up tree transducer ground term rewrite system bottom-up tree automaton