Equivalence of DFA and NDFA: Examples

Deterministic Starting and Ending with an a

This example shows the construction of a DFA equivalent to a given NDFA. It is equivalent to NDFA Starting and Ending with an a.

Local users: to run simulation (read here before running).

If AUTOMATA is already running, you's better load the file example08.aut from the main menu bar.

• click on the detAut button of the working session menu
• choose betwenn step by step an fast process
• insert the DFA on the main window clicking on the insert button Now it is possible, loading the tape example08.tape or writing directly a string, to show that this new automaton recognizes exactly the same language of the nondeterministic starting one.

  A more reasonable layout of this automaton is in file det08.aut.

  ---

  • Previous Example
  • Equivalence of DFA and NDFA