Consider the NFA whose transition graph is shown below: 90 a 94 b 91 a a a a,b. 93 95 a,b b a 96 (a) [5 Points] Construc

[answerhappygod]

Consider The Nfa Whose Transition Graph Is Shown Below 90 A 94 B 91 A A A A B 93 95 A B B A 96 A 5 Points Construc 1 (42.76 KiB) Viewed 43 times

Consider the NFA whose transition graph is shown below: 90 a 94 b 91 a a a a,b. 93 95 a,b b a 96 (a) [5 Points] Construct a transition graph for a DFA that is equivalent to this NFA. (b) [5 Points] Minimize the number of states in the DFA from your answer to 2(a). Your answer should have both the minimized graph and the work showing the minimization process. (c) [5 Points] What is the language accepted by the NFA and the DFA's you gave as answers in 2(a) and 2(b). Remember that the languages for all these should be the same since the machines should be equivalent; work with the most simple machine.