These states basically process (part of) the tree l and project (with state q) to the subtree at position v. It is guaranteed that each such subtree (indicated by v) is reached only once.
the copying is "resolved" once the states of the form l, q, v are left.