Question

Please answer the question by showing each step with full detail-explanation and clear hand writing

6. You are given the following primitive flow table, perform the state reduction 6 Present STAL B, o C D GE F, o G, o- H, o Solution:

Answer 1

Let us consider the primitive flow table Next step is to draw implication table check for the equivalent of two states If A = B(first box) there is no chance of equivalence state so x If A = C(2nd box) there is possibility because it is common \r\n Therefore from the implication we have checked for the possibility of equivalence Compatible pairs are (A,C);(B,C);(D,E);(B,F);(E,F);(C,G);(E,G);(F,G);(A,H);(G,H) Now if we merge the states (A,C);(B,C);(D,E);(B,F);(E,F);(C,G);(F,G);(A,H);(G,H) Now replace (E,F,G) = E (A,C);(B,C);(D,E);(B,E);(C,E);(A,H);(G,H) Merging three states (B,C,E) = B therefore (E,F,G) = B Replace in remaining states (A,B);(D,B);(A,B);(H,B) Now finally the compatible states are (A,B);(D,B);(B,H);(B,E,C,G,F) Now in the reduced table only states A,D,H,B exist