Notes of Minimization of DFA using Myhill-Nerode Theorem

A short notes from the above video lecture.

Minimization steps :

1. Make the table as shown in the procedure.

2. Marking into the table:(Iteration 1)

      if you are looking into two stages A and B, if only one of them is final, put a        mark into that field in the table.

      if both stages are final or no one is final don't do anything into the table.

3. Iteration 2:

    for all unmarked field do one more iteration, and if obtained state sequence        is marked in the previous iteration, then marked the previous filed on to which operation is performed.

    Do this until you are done with every state field. 

4. combine all the unmarked pair and put the transaction as accordance.