Deterministic Finite Automata
Description
This applet allows you to construct a DFA over the alphabet {a,b}, and
visualise the simulation of the DFA with various input strings.
- Transition Function: The choice boxes with the yellow background allow you to define the transition
function for each state and each input symbol. Click the 'Update' function after defining each transition.
- Final State: Select the final state from the choice box with the green background, and click the 'Update' button.
- Input String: Specify an input string using symbols a, b in the textfield, and click the 'Start' button to
start the simulation.
Automata Theory
Java Applets Centre
R. Mukundan
Department of Computer Science
University of Canterbury
Private Bag 4800, Christchurch
New Zealand.