School of Computer Science     University of Windsor

03-60-214: Computer Languages, Grammars and Translators




Sample DFA Simulator

Here is a DFA simulator developed by Nicolas Christin. You can play with the DFA to see how it works.

You need to define the DFA first, i.e., the alphabet, the states, and the transitions between the states. Note that you need to define those things in that order. Use "extend alphabet" bar to define the alphabet. When you define the transition, you need to select one or more symbols first. Then draw a line connecting two states. Double clicking on the ending state. left-click on a state will turn that state into a final state.

 Once you have defined the states, you can run the machine against a string, and see the animation how the string is recognized (or rejected) by the machine.

Instructor: Dr. Jianguo Lu     Email: jlu at uwindsor  Office: 5111 Lambton Tower        Phone: 519.253.3000 ext 3786