# Why the given NFA is not possible

I am trying to construct NFA for all languages ending in 00.

I got this

and this

First one I could convert to DFA by subset construction and I got the correct DFA. For the second one I got the DFA by subset construction, but it is not the correct one since it couldn't accept strings like 100.

Is this beacuse, there is no non determinism in the second NFA? Or what is the general rule in drawing an NFA? We could always provide some form of non determinism?

• The mistake isn't due to the absence of nondeterminism, as Yuval explains below. Also an NFA simply allows for the possibility of nondeterministic moves, it doesn't require them. In other words, a DFA can always be considered as an NFA that just happens not to have any nondeterministic transitions. – Rick Decker Feb 13 '14 at 2:55

The second NFA doesn't accept $100$. Make sure that you understand when an NFA accepts a given word. In this case, your NFA gets stuck at the very first character, since there is no transition labelled $1$ from the initial state.