  We prove that for a given partial functional attributed tree transducer with
monadic output, it is decidable whether or not an equivalent top-down
transducer (with or without look-ahead) exists. We present a procedure that
constructs an equivalent top-down transducer (with or without look-ahead) if it
exists.

Formal Languages and Automata Theory