Home » Theory of Computation » Theory of computation miscellaneous » Question

Theory of computation miscellaneous

Theory of Computation

  1. Which of the following is true?

    1. Every subset of a regular set is regular
    2. Every finite subset of a non-regular set is regular
    3. The union of two non-regular sets is regular
    4. Infinite union of finite sets is regular
Correct Option: B

Finite subset of non-regular set is regular as we know that Pumping Lemma can be applied on all the finite sets that states that all finite sets are regular. Infinite union of finite set is not regular because regular sets can never be closed under infinite union.



Your comments will be displayed only after manual approval.