Verification: DFA/NFA that accepts all strings over $\{0,1\}$ with exactly one block of $00$

Question

I am trying to design a DFA or NFA that accepts all strings over $\Sigma = \{0,1\}$ in which the block $00$ appears only once.

Here is what I've tried.

Can you verify that this accepts all string over $\{0,1\}$ that has exactly one block of $00$?

Answer 1

Yes, you constructed your NFA correctly. Note that to convert your NFA to a DFA, you can simply remove the loop transition $\delta(q_3,1)=q_3$, include the loop transition $\delta(q_4, 1) = q_4$, and draw an extra circle around $q_4$ in order to include it in your set $F$ of final/accept states.