GATE CS 2021 (Afternoon) — Question 46

Theory of Computation (TOC)Regular and Context-Free Languages & Pumping LemmaMCQ2 marks · −2/3 if wrongMedium

Consider the following two statements about regular languages: \(S_1\) : Every infinite regular language contains an undecidable language as a subset. \(S_2\) : Every finite language is regular. Which one of the following choices is correct?
  1. A
    Only \(S_1\) is true.
  2. B
    Only \(S_2\) is true.
  3. C
    Both \(S_1\) and \(S_2\) are true.
  4. D
    Neither \(S_1\) nor \(S_2\) is true.
Practise the full 2021-AN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAThis week's 10-question challengeSame 10 past-GATE questions for everyone this week — see where you stand.
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