Equivalence of DFA and NDFA: Examples

Deterministic Two Consecutive 1's or 0's

This example shows the construction of the DFA equivalent to a given NDFA. It is equivalent to the NDFA Two Consecutive 1's or 0's

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

If AUTOMATA is already running, you'd better load the file twoCon1or0.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 twoCon1or0.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 detTwoCon1or0.aut.

  ---

  • Next Example
  • Equivalence of DFA and NDFA