Consider the following two statements about regular languages: S1: Every…
GATE · 2021 · CS · Set 2 · Computer Science & IT
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
Attempted by 249 students.
Sign up free to check your answer
Sign up freeLoading lesson…