anyone can explain this ...
If a language is regular then every subset of this language is regular? Why?
The claim is obviously false, since any language is a subset of the Kleene star of its alphabet, which is trivially regular.
Copyright © 2021 JogjaFile Inc.
The claim is obviously false, since any language is a subset of the Kleene star of its alphabet, which is trivially regular.