COMPLETE requires that each of the nodes ofē i in R(p) have been identified, these nodes match up with the corresponding external nodes of the subgraph J, and that the subgraphs I and J are edge-disjoint.
(strings) by restricting the form of the productions in the grammars.