

McqMate
Q. |
Let P be a regular language and Q be context-free language such that Q ∈ P. (For example, let P be the language represented by the regular expression p*q* and Q be {pnqn n∈ N}). Then which of the following is ALWAYS regular? |
A. | P ∩ Q |
B. | P – Q |
C. | ∑* – P |
D. | ∑* – Q |
Answer» C. ∑* – P |
View all MCQs in
Theory of ComputationNo comments yet