Every tree t in conf(D) that is not in L(G ) is equivalent to some tree t in L(G ), because if t could not be rewritten into such a t , then t would be in relative normal form.
the algorithm solves the redundancy elimination problem.