Minimization of Deterministic Finite Automata (DFA)
Print this page
First   |   Last   |   Prev   |   Next
DFA Isomorphisms :

Two DFAs are said to be isomorphism if they are identical upto renaming of the states. Formally, DFA isomorphisms are defined as follows.

Definiton : Two DFAs and are isomorphic if there is a bijection s.t. the follwoing hold.

  1. , iff
  2. ,

     

 

First   |   Last   |   Prev   |   Next