GATE 2011

Question 13

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 [pⁿqⁿ | n ∈ N]). Then which of the following is ALWAYS regular?

A	P ∩ Q
B	P – Q
C	Σ* – P
D	Σ* – Q

Theory-of-ComputationRegular-Language

Question 13 Explanation:

Exp: Σ* – P is the complement of P so it is always regular,
since regular languages are closed under complementation.

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.

GATE 2011

Question 2635 – KVS 30-12-2018 Part-A

GATE 2011

Question 2635 – KVS 30-12-2018 Part-A

Related posts

STQC-NIELIT STA 2021