Minimization of Deterministic Finite Automata (DFA)
Print this page
First   |   Last   |   Prev   |   Next
we now show in the following that it satisfies all the three conditions.
  1. Note that, since f is a bijection, . Also note that . Hence, . Therefore, the initial state of is mapped to the initial state of M thus satisfying the first condition.
  2. We know that for any

    ( by definition)
    (Since M accepts L)
    ( by definition of f )
    Thus final state of are mapped to final stat of M , satisfying the second condition.
First   |   Last   |   Prev   |   Next