The GATE Grind

GATE 2007 CS – Question 7

Theory of Computation · Regular and Context-Free Languages, Pumping Lemma · 1 mark · Multiple choice

Which is TRUE?

  1. Every subset of a regular set is regular.
  2. Every finite subset of a nonregular set is regular.
  3. Union of two nonregular sets is not regular.
  4. Infinite union of finite sets is regular.

Practise this question in The GATE Grind →

Show answer and explanation

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

All Regular and Context-Free Languages, Pumping Lemma questions →