CS 250 Homework - Computational Complexity

1. Explain why all regular languages are in P.

2. Explain why if NP is not equal to co-NP then P is not equal to NP.
(co-NP is the class of languages whose complement is in NP.)

3. p361 #1 (You will want to use the fact that the Hamiltonian cycle problem is NP-complete)

4. p362 #4