Theory of Computation207810 marksNumerical: DFA minimizationMinimization of Finite State Machines
Find the minimum state DFA for the given DFA below: | States | 0 | 1 | |--------|---|---| | A | B | F | | B | E | C | | C | B | D | | *D | E | F | | E | B | C | | F | B | A |
Find the minimum state DFA for the given DFA below:
| States | 0 | 1 |
|---|---|---|
| A | B | F |
| B | E | C |
| C | B | D |
| *D | E | F |
| E | B | C |
| F | B | A |
[10]
Transition table: States 0 1 -------------- A B F B E C C B D D E F E B C F B A - Start state: A - Final state: D - Alphabet: {0, 1} - Final: {D} - Non-final: {A, B, C, E, F} Mark all pairs (X, D) for X in {A,B,C,E,F} as distinguishable: Marked: (A,D), (B,D), (C,D), (E,D), (F,D) (A,C): 0: (B,B); ...