Al and Izzy: m ≤ n

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.

Name:
You will play the role of Al and the computer will play the role of Izzy. The language in question is
{ambn : m ≤ n}

Note: Most choices of z won't work. Use the UNDO button a lot until you get the idea.

Please send comments and suggestions to Professor Beigel.