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

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

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.