Finding nfa or dfa for a language

Question

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

score 4 · Answer 1 · answered Jun 03 '16 at 17:14

4

That language is not regular, thus no finite automaton, be it a DFA, NFA or εNFA, is sufficiently powerful to express it.

To express this language, you'll need a context-free grammar, a push down automaton, or a Turing machine.

answered Jun 03 '16 at 17:14

Alexander

528
2
8

score 1 · Answer 2 · edited Jun 03 '16 at 17:36

1

This language has infinite index, thus needs an infinite number of states according to the Myhill–Nerode theorem. You can't have a finite state automaton for it.

edited Jun 03 '16 at 17:36

Evil

9,525
11
32
53

answered Jun 03 '16 at 17:16

Pavel

1
3
13

Finding nfa or dfa for a language

2 Answers2