If a language is regular then every subset of this language is regular?

27 Views Asked by At

anyone can explain this ...

If a language is regular then every subset of this language is regular? Why?

1

There are 1 best solutions below

0
On BEST ANSWER

The claim is obviously false, since any language is a subset of the Kleene star of its alphabet, which is trivially regular.