Like the algorithm of (Mohri, 1997), this Figure 4: a) Portion of a transducer before determinization; b) The same portion after determinization algorithm will terminate for automata that recognize finite tree languages.
if we choose v then a valid vector pair q w is q , w .