# Language resulting in the same NFA as the DFA

I have tried to construct the NFA and DFA from the same language term, and they keep coming out the same, I was wondering if this is correct for:

{w | w has an even length and an odd number of a's} such that w contains characters from $\{a,b\}$.

• That looks correct for a DFA. And I think every DFA is also an NFA. – Trevor Norton Dec 31 '15 at 17:53
• it looks correct. – Daga Dec 31 '15 at 17:54
• That's what I thought and I literally cannot think of a way to make them differ from each other. – Danny Dec 31 '15 at 18:04
• You can always join two independent automata together in an appropriate way :-). – copper.hat Dec 31 '15 at 18:16
• It looks correct, and, yes, DFAs are NFAs. – BrianO Dec 31 '15 at 20:48