Question

infinite Minimum Number automata​

Answer 1

Answer:

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

It is possible to prove for any regularlanguage 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

Example 1: Minimum Two Consecutive 1's or 0's

Previous Section

Next Section

 Back to Index