GATE | GATE CS 2021 | Set 2 | Question 46
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
- 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.