Question: 1. Explain why all regular languages are in P 2. The class of languages co-NP contains all languages whose complement is in NP. Explain why
1. Explain why all regular languages are in P
2. The class of languages co-NP contains all languages whose complement is in NP. Explain why if NP is not equal to co-NP then it must be the case that P is not equal to NP.
3. is it possible that P = NP is undecidable?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
