Question

3- Given the NFA below, write the transition functions and then draw the equivalent DFA. (10 Points) Note: The transitions between qo and q1 are either a, or lambda. q2 q0 q1
related to theory of automation. thank you.

Answer 1

NFA Transition function is represented through transition table NFA has null entries phi is transition function phi(q_0, a) = q_1 phi(q_1, b) = q_2 (Final state is one which contain final state of NFA) phi([q_1, q_2], a) = phi(q_1, a) Union pi(q_2, a) = null Union q_2 = q_2 null represents dead state. \r\n DFA