Minimum Automata: Examples

Minimum Two Consecutive 1's or 0's

This example shows the construction of the minimum automaton accepting the language of strings that have two consecutive 0's or two consecutive 1's.

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

If AUTOMATA is already running you can load the file `detTwoCon1or0.aut` from the `main menu` bar.

To visualize the minimization algorithm:

click on the detAut button, and then on the minAut of the working session menu
choose between step by step and fast process
insert the minimum automaton in the main window

You can see a more readable version of this automaton loading the file minTwoCon1or0.aut.

Minimum Automata

Minimum Automata: Examples

Minimum Two Consecutive 1's or 0's

If AUTOMATA is already running you can load the file detTwoCon1or0.aut from the main menu bar.

If AUTOMATA is already running you can load the file `detTwoCon1or0.aut` from the `main menu` bar.