-
Let P be a regular language and Q be a context free language such that Q ⊆ P. For example, let P be the language represented by the regular expression p*q* and Q be ( Qn pn qn | n ∈ N ) Then which of the following is always regular?
-
- P ∩ Q
- P - Q
- ∑* - P
- ∑* - Q
- P ∩ Q
Correct Option: C
∑* - P and ∑* - P is the complement of P and complement of regular language is also regular.
