Al and Izzy: Primes

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
{an : n is prime}

Note 1: Once your confidence is built up, check the HARD box.

Note 2: Compare your strategy to the strategy on Page 302.

You might find a table of prime numbers helpful.

Please send comments and suggestions to Professor Beigel.