I want to disprove the following statement:
"if $L$ is the union of infinitely many regular languages, then $L$ is guaranteed to be a regular language."
I don't know where to start. Any hint will be appreciated.
I want to disprove the following statement:
"if $L$ is the union of infinitely many regular languages, then $L$ is guaranteed to be a regular language."
I don't know where to start. Any hint will be appreciated.
Copyright © 2021 JogjaFile Inc.
Every finite language is regular. Pick any language of which you know it isn't regular and write it as the union of infinitely many finite languages.