Question 8948 – GATE 2011
April 15, 2024Question 2635 – KVS 30-12-2018 Part-A
April 15, 2024Question 8962 – GATE 2011
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 [pnqn | n ∈ N]). Then which of the following is ALWAYS regular?
Correct Answer: C
Question 13 Explanation:
Exp: Σ* – P is the complement of P so it is always regular,
since regular languages are closed under complementation.
since regular languages are closed under complementation.
P ∩ Q
P – Q
Σ* – P
Σ* – Q
Subscribe
Login
0 Comments