Time left $0$:$29$:$22$

Question $1$

Not yet saved

Marked out of $10\mathrm{.}00$

Flag question

Question text

Adopt the input language $\{0,1\}$

and consider the following non$-$deterministic finite state automaton $($NFA$)$:

a non$-$deterministic FSA

Apply the subset construction to convert this NFA into a deterministic finite state automaton $($DFA$)$ that recognises the same language.

To help you we've done some of the work, by providing a partially completed state diagram. All you need to do is drag and drop the corrext labels, which name the states of the constructed DFA using sets of state labels from the original NFA, onto the correct nodes of the following diagram:

Background image for dragging markers ontoblank blank blank blank blank blank blank blank blank