The states of the deterministic machine are the elements of the power set of the states of the non-deterministic machine.

'NonDet -> Det' button will convert the current non-deterministic machine to a deterministic machine. This is only applicable to deterministic machines. 'Minimize' button will remove inaccessible states, complete the machine (add any missing transitions, all going to a non-accepting state),įind all indistinguishable states, and merge them together, to form a minimal machine. 'Remove Inacc' button will remove any inaccessible states from the current machine. 'Deterministic?' button will determine whether the current machine is deterministic - there is never more than one transition for a particular character originating from a state. The current mode can be changed by selecting from the toolbar, or by pressing the first letter of the mode name, when in the main window. Click on the transition character(s) to remove a connection. States can be repositioned by dragging them with the mouse when in Move mode.ĭelete mode can be used to remove states or connections. Toggle mode changes the acceptance status of states. Pressing any other key will cancel the connection operation.Ī valid machine must have a start state which can be designated when in Start mode. Valid characters for transitions are upper and lower case letters, and digits. Then press a key for that transition, to create the connection. Then click on the destination state, which should also become green. To connect states, select Connect mode, then click on the state the connection is to originate from, so that it changes color to green. Here are some images of the completed part of the projectĬlick in the main window to create new states, when in Add mode. Students had completed (plan to complete) a course in Automata theory Students are able to (are willing to learn to) write programs in JavaĢ. It is desirable if students have (or willing to learn) the following abilitiesġ. In this project students will be requested to study and implement someĮxamples such as machines, games, puzzles, etc. (such as computer engineers, software designers, game designers, researchers, and students) to use and learn automata in a convenient environment. Several automata examples can be visualized and implemented asĪ web-based applications. Visual Automata implementation and SimulationĪutomata can be used as a model for several software and

Visual automata simulator