Theory Of Computation Test – Question 2

Consider the following statements regarding  Set of “All Non-regular” languages

1. It is closed under Union.
2. It is closed under Concatenation.
3. It is closed under Complementation.
4. It is  an uncountable set.

Which of the above statements is/are correct ?

  • 1.
  • 2.
  • 3.
  • 4.

Leave a Reply

Your email address will not be published. Required fields are marked *