The tree transformation computed by M is the relation where ⇒ * is the reflexive, transitive closure of ⇒.
the tree t can be transformed into u if there exists an initial state q such that we can derive u from q(t) in several derivation steps.