Minimization of Deterministic Finite Automata (DFA)
Print this page
First   |   Last   |   Prev   |   Next
  • To show that f is one-to-one, we need to show that if , then p = q . That means, we need to show that if , then . (since are the representative of different equivalence classes of , this proves that f is one-to-one ).

Let =.

Then

Therefore for any .

Hence, by definition of ,

iff or .

This shows that f is a bijection.

First   |   Last   |   Prev   |   Next