This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Give a proof for your answer. 3. Outline the proof that a one state nondeterministic pda can simulate a many state nondeterministic pda. 4. State and prove Rices theorem for recursively enumerable sets. 5. (a) What does it mean to say that a problem is NPcomplete? (b) State what the clique problem is? (c) Prove that the clique problem is NPcomplete. You may assume that the 3CNF satisfiability problem is NPcomplete in your proof. Problems will be graded on clarity and conciseness of answers as well as correctness. Good luck and have a nice holiday....
View
Full
Document
 Fall '07
 HOPCROFT

Click to edit the document details