Question:

Let P be a regular language and Q be a context-free language such that Q ⊆ P. Then which of the following is always regular?

Show Hint

Regular languages are closed under intersection with other languages, including context-free languages.
Updated On: Dec 29, 2024
  • P ∩ Q
  • P − Q
  • Σ* − P
  • Σ* − Q
Hide Solution
collegedunia
Verified By Collegedunia

The Correct Option is A

Solution and Explanation

The intersection of a regular language P with any language (including a context-free language Q) is always regular. This is because regular languages are closed under intersection with other languages, including context-free languages. Therefore, P ∩ Q will always be a regular language.
Was this answer helpful?
0
0

Questions Asked in CUET PG exam

View More Questions