QUESTION 1 Below is transition table of a DFA Start Final Final Final S 3 4 2 3 4 5 a 1 2 2 4 5 4 b 3 2 2 2 5 4 In context of minimizing this DFA using algorithm discussed in class, Indicate how many states are there in the minimum state DFA
QUESTION 2 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 S Final Final Final (2,3) O (S.2) O (1.2) (1.3) (3,5) □ (3,4) (S.1) 2 3 4 5 1 2 2 4 5 4 b 3 2 2 2 5 4 In context of minimizing this DFA using algorithm discussed in class, Indicate all the pairs which are in E₁ □ (S.3) (4,5) (S.4)
QUESTION 3 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 S Final Final Final 1 2 3 4 5 a 1 2 2 4 5 4 b 3 2 2 2 5 4 In context of minimizing this DFA using algorithm discussed in class, Indicate all the pairs which are in E2 □ (S.1) (2,3) (1,3) (S.3) (S.2) (3,4) (4,5) (3,5) O (1.2) (S.4)
QUESTION 1 Below is transition table of a DFA Start Final Final Final S 3 4 2 3 4 5 a 1 2 2 4 5 4 b 3 2 2 2 5 4 In conte
-
- Site Admin
- Posts: 899603
- Joined: Mon Aug 02, 2021 8:13 am