  We prove that for a given deterministic top-down transducer with look-ahead
it is decidable whether or not its translation is definable (1)~by a linear
top-down tree transducer or (2)~by a tree homomorphism. We present algorithms
that construct equivalent such transducers if they exist.
