Subject : Theory of Language and Automata

Here, you are given a nondeterministic machine. Convert the machine from NDFSM to DFSM following the algorithm described in the lecture material (slides/textbook). Show the active states found sequentially and their transitions according to each input symbol (you can write them in tabular format, but each table entry should correspond to the order of the active state found previously)