this is a TOC problem $,$ theory of computation, what needs to do is to convert the state diagram from a non deterministic to a deterministic diagram without the epsilon.

Textbook is specifying software a hands$-$on introduction$\_$chapter $8($can be found online$)$

Answer the question if and only if you know the answer. Otherwise, you can leave it for someone who actually does know TOC.

Let $=\{0,1\}$ and consider the following nondeterministic state transition diagram with

$-$transitions:

Using the systematic method described in class $($and in the text$),$ convert the transition dia$-$

gram into an equivalent $($non$)$deterministic transition diagram without $-$transitions. Do not

modify or simplify the resulting diagram any further.

Let $=\{a,b,c\}.$ Using the systematic method described in class and textbook convert the

following nondeterministic state transition diagram into a deterministic transition diagram:

Describe how the deterministic transition diagram is obtained from the nondeterministic

one as follows: label the states of the deterministic diagram by sets of states of the nondeter$-$

ministic diagram $($like we did in class$).$