... n] denotes the tree that is obtained from t by replacing (in parallel) the subtrees at pi by ti for every i ∈ [k] Finally, let us recall regular tree languages A finite tree automaton M is a tuple ... ⊆ Q We extend δ to a mapping δ : TΣ → 2Q by δ(σ(t)) = {q | (q, σ, q) ∈ δ, ∀i ∈ [ |t| ] : qi ∈ δ(ti )} ∗ for every σ ∈ Σ and t ∈ TΣ The finite tree automaton M recognizes the tree language L(M ... (2009), we recall a variant of linear and nondeleting extended multi bottom-up tree transducers (MBOT) here Occasionally, we will refer to general MBOT, which differ from the local variant discussed...