- Question 3 This Is A Multiple Answer Choice Question You Will Have To Choose Multiple Options To Discourage Random Gue 1 (22.56 KiB) Viewed 28 times
QUESTION 4 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 -10%) Below is transition table of a DFA Start Final Final Final S 1 2 3 4 a 1 2 2 4 5 4 In context of minimizing this DFA using algorithm discussed in class, Indicate all the pairs which are in E₁ O {2,3} O {S,2} {1,2} O {S,1} (3,4) O {S,3} (3,5) O (4,5) O (1,3) O {S,4} b 3 2 2 2 5 4
QUESTION 5 Below is transition table of a DFA Start Final Final Final S 2 3 4 a 1 2 2 4 5 4 Which of the following 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} and {3} are states in the minimum state DFA and edge from {S} to {3} is 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 b 3 2 2 2 5 4