Language resulting in the same NFA as the DFA

792 Views Asked by At

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\}$.

my answer