3. (9pts) Follow the given steps to convert an NFA to its equivalent DFA: Suppose we are given the following NFA over th
Posted: Tue May 24, 2022 7:43 am
a. (2pts) Compute the lambda-closure for each of the following states: λ(0) = λ(1) = λ(2) = λ(3) = b. (3pts) Compute the transition table (you have to determine the number of rows based on your calculations) for the DFA. Label out start and final states: a b {0, 1} c. (4pts) Give the transition table with renamed states, and draw the graph version of the DFA for this table.