Minimize the following DFA. The start state is 1, the finish states are 6 and 7
ID: 3528374 • Letter: M
Question
Minimize the following DFA. The start state is 1, the finish states are 6 and 7 Current ...... State..........input............next state 1........ .......A................ ..3 1 ...............B ..................2 2 ...............A ..................6 2 ...............B ..................7 3 ................A.................. 4 3 ................B................. 5 4 ...............A .................4 4 ...............B .................5 5 ................A................. 6 5 ................B................. 7 6 ...............A.................. 4 6 ...............B ..................5 7 ................A .................6 7 ................B .................7Explanation / Answer
As 3,4 and 6 have the same outputs in A and B... Hence, only one of them needs to be considered... So, only 6 will be considered in place of 3 & 4 as it is the final state... As 2,5 and 7 have the same outputs in A and B... Hence, only one of them needs to be considered... So, only 7 will be considered in place of 2 & 5 as it is the final state... Now, what remains is 1(A->6 B->7), 6(A->6 B->7) and 7(A->6 B->7).....