GATE 2021 SET-2 | TOC | UNDECIDABLE | GATE TEST SERIES | SOLUTIONS ADDA | EXPLAINED BY POOJA

GATE 2021 SET-2 Q32: 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.?

Website: https://solutionsadda.in/
ISRO / DRDO PYQs: https://solutionsadda.in/isro/
GATE PYQs : https://solutionsadda.in/gate1/
NIC - NIELIT PYQs: https://solutionsadda.in/nielit/

ISRO Complete Analysis: https://solutionsadda.in/isro-complet...
NIC-NIELIT Complete Analysis: https://solutionsadda.in/nielit/
GATE Complete Analysis: https://solutionsadda.in/gate-complet...

For GATE, BARC, ISRO, CIL, AAI, HAL, UGC NET JRF, NIC NIELIT, STQC NIELIT, NVS, KVS, DSSSB PGT/TGT
Test series : https://solutionsadda.in/test-series/

If you have any queries write a mail: [email protected]
Face Book Page:   / solutionsaddain-111628724482494  
Telegram: https://t.me/solutionsaddaforcse