A tutorial on finite automata

Minimum Automata

There exist infinite many equivalent automata recognizing a same language L.

It is possible to prove for any regular language L, the existence and the unicity, up to an isomorphism, of a minimum automaton recognizing it.

This automaton has the minimum number of states.

Examples

  1. Example 1: Minimum Two Consecutive 1's or 0's
Back to Index