Determine DFA from NFA Given NFA, the following sequence of steps builds DFA states (Dstates), which are sets of NFA states, and transition table (Dtran): 1. Create a new start state, that is a set of NFA states: Ao -closure(so) 2. Select a state A and an input be , and determine its transition: Dtran[A, b] =-closure (move(A, b)) 3. Define e-closure(move(A, b)) as a new state A if it is a new state: A; # A Vi 4. Repeat steps 2-3 until no more new states found. 5. Any states that include NFA's final states become final states. Example) start 10