Al and Izzy: Squares
This Java applet is designed to help you understand the pumping
theorem for regular languages. For background see Section 4.9.1 of
the Language of Machines by Floyd and Beigel.
You will play the role of Al and the computer will play the role of
Izzy. The language in question is
{an2 : n >= 0}
Note: Compare your strategy to the strategy on Page 303.
Please send comments and suggestions to Professor Beigel.