Al and Izzy in context: i < j < k

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
{aibjck : i < j < k}

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

Note 2: Make sure to hand in at least one win with v=b and at least one win with v=ab. Otherwise you won't get credit for this problem.

Please send comments and suggestions to Professor Beigel.