Description
This applet simulates a PDA that is designed to recognise strings containing a set of balanced parentheses. The transition function is defined as follows:
f(q0, (, e) = (q0, X)
f(q0, (, X) = (q0, XX)
f(q0, ), X) = (q0, e)
The PDA accepts a string by empty stack.

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