Prove or disprove or this statement:
The union of an infinite number of regular languages is regular.
Can someone help?
Computer Science Stack Exchange is a question and answer site for students, researchers and practitioners of computer science. It only takes a minute to sign up.Sign up to join this community