Therefore, given a graph G that satisfies the NO-COVERED-ROOTS constraint, we know that the transition sequence built as in that proof will never reduce a root node.
all of its REDUCE transitions will be applied to configurations in H σ (C) and, hence, that same transition sequence will also parse G in this variant of the transition system, which proves completeness.