Intro So far we have seen, by example and by closure properties, what RLs are. Now ask what are NOT regular languages. One in next class. One on the course web pages.
All finite languages are regular.
So, only infinite languages are interesting for this discussion. Number the states corresponding to the input symbols. Consider any one such loop. Machine could go around loop an arbitrary number of times, given different inputs. Assume input x is accepted, thus qm final.