Open In App

GATE | GATE CS 2021 | Set 2 | Question 46

Like Article
Like
Save
Share
Report

​​​​​​Consider the following two statements about regular languages:

  • S1: Every infinite regular language contains an undecidable language as a subset.
  • S2: Every finite language is regular.

Which one of the following choices is correct?
(A) Only S1 is true
(B) Only S2 is true
(C) Both S1 and S2 are true
(D) Neither S1 nor S2 is true


Answer: (C)

Explanation:

  • S1: True. We can construct a subset N of A that we will prove nonregular by using pumping lemma.
  • S2: True. Every finite language is Regular. Because we can draw DFA for it.


Quiz of this Question


Last Updated : 23 May, 2021
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads