Answer Happy

QUESTION 4 Below is transition table of a DFA Start S Final Final Final 1 2 3 5 a 1 2 2 4 5 4 Which of the following is true about the minimum state DFA of the given DFA? O (1) and (2) are states in the minimum state DFA and edge from (1) to (2) is a, b O (S.1,3) is a state in the minimum state DFA O (S) and (4,5) are states in the minimum state DFA and edge from (S) to (4,5) is a O (S) and (3) are states in the minimum state DFA and edge from (S) to (3) is b b 3 2 2 2 5 4
QUESTION 5 This is a multiple answer choice Question. You will have to choose multiple options. To discourage random guess, choosing wrong option will have negative points (each wrong choice is -20%) Below is transition table of a DFA Start S Final Final (3,4) □ (S.4) Final (2.3) (1.3) (S.1) 2 3 4 5 a 2 2 4 5 4 b 3 2 2 2 5 In context of minimizing this DFA using algorithm discussed in class, Indicate all the pairs which are in Eg (4.5) (3,5) (S.2) (5.3) Ⓒ (1.2) 4