disproving union of infinitely many regular languages

356 Views Asked by At

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.

1

There are 1 best solutions below

3
On BEST ANSWER

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.