1. Computer Science Engineering (CSE)
  2. Theory of Computation
  3. Unit 1
  4. Let P be a regular language and Q be con...
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 Computation

Discussion