Exercises marked with (*) require further reading/search beyond the suggested texts.
4. Reduce the tree in Figure 3 of Booth and Lueker's 1976 paper with respect to S = {C, F}. Here also the online implementation above can help you.
Answer:
Figure 3 of Booth and Lueker's 1976 paper is:
Using the online PQ-tree implementation available at
http://www.jharris.ca/portfolio/code/pqtree/PQTree.html
the reduction goes through the following steps: Step 1: "C" becomes full
Step 2: "F" becomes full
Step 3: The parent of "E" and "F" becomes a partial Q-Node, and "E" and "F" are reversed
Step 4: This step does not correspond to a pattern, thus the final reduction is a null tree.
© 2015 Joao Meidanis