q1 92 *93 94 0 {91, 93} 93 must use all states at least once. q2 94 Table 1 Transition Table 1 q4 q1 {93, 91} q2 (a)- Co

[answerhappygod]

Q1 92 93 94 0 91 93 93 Must Use All States At Least Once Q2 94 Table 1 Transition Table 1 Q4 Q1 93 91 Q2 A Co 1 (47.07 KiB) Viewed 30 times

q1 92 *93 94 0 {91, 93} 93 must use all states at least once. q2 94 Table 1 Transition Table 1 q4 q1 {93, 91} q2 (a)- Construct the transition diagram for the given transition table of Non- Deterministic Finite Automata (NFA) (10 Marks) (b)- prove that the input string 0110 is accepted in the NFA in question (a) and (10 Marks)