Let A be a set which contains all non-regular languages. Then set B which is finite subset of A. Then will it be regular ?

I know that A is not recursive enumerable set (undecidable). So I wonder that if finite subset of undecidable set is a regular language or not.


Your question doesn't make sense because of a category error. "Regular" is a property of sets of strings. A set of languages is a set of sets of strings, so it doesn't make sense to ask if it's regular.

| cite | improve this answer | |
  • $\begingroup$ Accepted the fact. thanks! $\endgroup$ – Gaurav Tank Jul 28 '19 at 20:48

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.