GATE CS 2023 (Forenoon) — Question 24

Theory of Computation (TOC)Regular and Context-Free Languages & Pumping LemmaMSQ1 markMedium

Which of the following statements is/are CORRECT?
  1. A
    The intersection of two regular languages is regular.
  2. B
    The intersection of two context-free languages is context-free.
  3. C
    The intersection of two recursive languages is recursive.
  4. D
    The intersection of two recursively enumerable languages is recursively enumerable.
Practise the full 2023-FN paper
Challenge a friend: WhatsApp Telegram
Recommended book · affiliate linkIntroduction to Automata Theory (Hopcroft & Ullman)Regular languages, CFGs, pushdown automata and Turing machines.
Practise more on Regular and Context-Free Languages & Pumping LemmaTimed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group