Al and Izzy in context: Composites

This Java applet is designed to help you understand the first pumping theorem for context-free languages. For background see Sections 4.9.1 and 5.8 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 composite}

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

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

You might find a table of prime numbers helpful.

Please send comments and suggestions to Professor Beigel.