GATE Computer Science (CS) 2021 Shift 2 Solved Paper
© examsiri.com
Question : 46 of 65
Marks:
+1,
-0
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?
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?
Go to Question: