Deterministic PDA

Description
This applet simulates a Deterministic PDA that is designed to recognise the language
The transition function is defined as follows:
f(q0, a, e) = (q1, e)
f(q0, a, b) = (q0, e)
f(q0, b, e) = (q0, b)
f(q0, b, b) = (q0, bb)
f(q1, a, e) = (q1, a)
f(q1, a, a) = (q1, aa)
f(q1, b, a) = (q1, e)
f(q1, b, e) = (q0, e)
The DPDA accepts a string by moving to the final state q1.

• Input String: Specify an input string in the textfield, and click the 'Start' button to start the simulation.