# Finding nfa or dfa for a language [duplicate]

I'm trying to study for the summer ahead of class I saw this question, please how do I go about it?

Find NFA/DFA for the language $L = \{0^n1^n : n \in N\}$

• What exactly is your question? What have you tried? What have you read? Where did you get stuck? Are you sure that DFA/NFA will be able to solve this? – Evil Jun 3 '16 at 16:46
• Probably a trick exercise. Did you already read about the pumping lemma? Then try to apply it to show that $L$ is not regular. – Bakuriu Jun 3 '16 at 19:05

• This answer is correct, but somebody who can't instantly recognize that $\{0^n1^n\mid n\in\mathbb{N}\}$ is non-regular probably doesn't know enough to use Myhill-Nerode. – David Richerby Jun 3 '16 at 17:29