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 Rice’s theorem for recursively enumerable sets. 5. (a) What does it mean to say that a problem is NP-complete? (b) State what the clique problem is? (c) Prove that the clique problem is NP-complete. You may assume that the 3-CNF satisfiability problem is NP-complete 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
- Summer '07
- Formal language, Boolean satisfiability problem, recursively enumerable sets, nondeterministic PDA, Upson, state nondeterministic pda