|
|
Description
This applet simulates a PDA that is designed to
recognise the language . The transition function
is defined as follows:
f(q0, a, e) = (q0, X)
f(q0, a, X) = (q0, XX)
f(q0, b, X) = (q1, e)
f(q1, b, X) = (q1, e)
The PDA accepts a string by empty stack.
Automata Theory
Java Applets Centre