Our Second Pushdown Automaton

We might remember another language that befuddled an FSA , {ww^r | w ∈ {0,1}*}

Example: Recognizing L = {ww^r | w ∈ {0,1}*} with a PDA

Below is a PDA that recognizes L. Try it with

1. ε, the empty string (this just means that you simply run the PDA on an empty input tape.
2. 0
3. 00
4. 0110
5. 100100
6. Any other strings you desire until you are convinced that this PDA will accept all strings that are in the language L and reject all strings that are not in L.

(Need help running the PDA? Right click here to open help in new window. )