Outline of the lesson

Some languages are finite. They are always regular.

Some languages are infinite. If they are regular then they must all share a property, they must repeat is some way. We will examine this in the following lesson.

As the fsa is run, when transitions and states are repeated, they will be highlighted in different colors.

Example: ab*c

The b repeats

This applet requires the Java Plug-In version 1.3.

Pumping 2