Name: ____________________________________________________ Alpha: _____________________

Describe help received: _________________________________________________________________

## Problem 2

Use JFLAP to build a PDA accepting the language of all strings
over the alphabet {a,b} having the same number of a's as
b's. Notice that in this language the a's and b's can
appear in any order! I recommend the

**Input/Fast Run ...**
option to test with. If there's no accepting
computation, it tells you so. If there is, it list one
accepting computation. Of course, since the machine is
non-deterministic, there could be many.

**Note:**
While you don't actually need it for this problem,
remember that you can push and pop arbitrary

*strings* from the stack.

**Turn In** a screen capture / printout showing your machine!