Al and Izzy in context: Primes
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.
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: The strategy on page 302 is a good starting point.
You might find a table of prime numbers helpful.
Please send comments and suggestions to Professor Beigel.