Correct answer: (B) Every finite subset of a nonregular set is regular.
Explanation
We are sorry we couldn't write detailed soluition for this, we are working on it!, please consider asking your own AI, its just 2-3 clicks with very minimum effort
More Regular and Context-Free Languages, Pumping Lemma questions
GATE 2007 CS Q31– Which language is regular? Here wᴿ denotes reversal and + means nonempty strings.
GATE 2025 CS (CS1) Q44– Consider the following two languages over the alphabet \a,b\: L 1 = \ \a,b\+ AND \a,b\+ \…
GATE 2025 CS (CS1) Q45– Consider the following two languages over the alphabet \a,b,c\, where m and n are natural…
GATE 2025 CS (CS2) Q24– Which ONE of the following languages is accepted by a deterministic pushdown automaton?
GATE 2025 CS (CS2) Q30– Consider the two lists List I and List II given below: List I List II --- --- (i) Context…
GATE 2025 CS (CS2) Q52– Let = \a, b, c\. For x *, and , let \# (x) denote the number of occurrences of in x. Which…