Automata Theory - Designing a Non-deterministic Finite automata

Question

I have been combing through youtube looking for a simple explanation on how to "crack" the "NFA" myth. Please help. Since drawing the schematic can be cumbersome, if you can show me how I can derive the transition states, I will be able to draw the schematic (that I am ok with).

Question:

• Draw Non-deterministic Finite automata that will accept {ab, ba}

==============================================

The above was the question: The scan below is the original question from a textbook - and I only wanted to know part 1 of the question. Let me know if this is still not clear.

Answer 1

You'll need a start state that can lead into two paths, one of which accepts $ab$, the other of which accepts $ba$. You should be able to construct a NFA from that; I'm not sure what the "NFA myth" is.

Answer 2

Try this automata, it is deterministic and this is a private case of non deteministic , so it is also non deteministic by defenition that accepts the language $\mathcal L=\{ab,ba\}$