Ask a Question

step of minimization of finite automata


Shilpi

on 2011-02-19 10:30:00  

As an eg: p/s x=0 x=1 A E,0 D,1 B F,0 D,0 C E,0 B,1 D F,0 D,0 E C,0 F,1 F B,0 C,0 Step-1:P0=(A,B,C,D,E,F) Step-2:P1 is based on output x=0 x=1 A->E,0} D,1}vary] B->F,0}same D,0} C->E,0} B,1]same P1=(A,C,E),(B,D,F) Step-2:P2 is based on input. D->F,0 D,0 E->C,0 F,1 F->B,0 C,0 P2=(A,C,E),(B,D),(F) Step-3:A->E,0 D,1 C->E,0C,0 F,1 B->F,0 D,0 F->B,0 C,0 D->F,0 D,0 P3=(AC)(E)(BD)(F) Pk=Pk+1 Hence,P3=P4 Now,minimized form is: P/s x=0 x=1 AC E,0 BD,1 E AC,0 F,1 BD F,0 BD,0 F BD,0 AC,0