GATE CS 2020 (Forenoon) — Question 20

Theory of Computation (TOC)Regular and Context-Free Languages & Pumping LemmaMCQ1 mark · −1/3 if wrongMedium

Consider the language \( L = \{a^n \mid n \ge 0\} \cup \{a^nb^n \mid n \ge 0\} \) and the following statements. I. \( L \) is deterministic context-free. II. \( L \) is context-free but not deterministic context-free. III. \( L \) is not LL(\( k \)) for any \( k \). Which of the above statements is/are TRUE?
  1. A
    I only
  2. B
    II only
  3. C
    I and III only
  4. D
    III only
Practise the full 2020-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