Pushdown Automata

Description
This applet simulates a PDA that is designed to recognise the language
The strings of the language are palindromes over (a,b), with a special middle character 'c' (Eg. aaabacabaaa). The transition function is defined as follows:
f(q0, a, e) = (q0, a)
f(q0, a, a) = (q0, aa)
f(q0, a, b) = (q0, ab)
f(q0, b, e) = (q0, b)
f(q0, b, b) = (q0, bb)
f(q0, b, a) = (q0, ba)
f(q0, c, e) = (q1, e)
f(q0, c, a) = (q1, a)
f(q0, c, b) = (q1, b)
f(q1, a, a) = (q1, e)
f(q1, b, b) = (q1, e)
f(q1, e, e) = (q2, e)
The PDA accepts a string by moving to the final state q2.

• Input String: Specify an input string (a palindrome with 'c' as the middle character) in the textfield, and click the 'Start' button to start the simulation.