4/28/2018 Difference Between DFA NFA | NFA Vs DFA automata | Engineer's Portal

Difference Between DFA NFA | NFA Vs DFA

automata
By Er Parag Verma - Mar 20, 2016

The finite automaton or finite automata theory has several classes that include the
Deterministic Finite Automata (DFA) and the Nondeterministic Finite Automata (NFA). These
two classes are transition functions of finite automata or finite automaton and they have
some significant differences those are completely distinguishes the behavior of the finite
auotmata. Here two separate tables those are clearly explain about the difference
between the DFA and NFA and compare the performance of DFA and NFA on the behalf of
various fields;

Difference between Deterministic Finite Automata  and the

Non deterministic Finite Automata ((DFA Vs NFA):
S.
DFA NFA
No.
We do not need to specify how does
For Every symbol of the alphabet, there
1. the NFA react according to some
is only one state transition in DFA.
symbol.
NFA can use Empty String transition.
2. DFA cannot use Empty String transition.

NFA can be understood as multiple

little machines computing at the same
3. DFA can be understood as one machine. time.

If all of the branches of NFA dies or

DFA will reject the string if it end at
4.
other than accepting state.
5. Backtracking is allowed in DFA.
6. DFA can be understood as one machine.
DFA will reject the string if it end at
7.
other than accepting or final state.
8. DFA is more difficult to construct.
rejects the string, we can say that NFA
reject the string.
Backtracking is not always allowed in
NFA.
NFA can be understood as multiple
little machines computing at the same
time.
If all of the branches of NFA dies or
rejects the string, we can say that NFA
reject the string.
NFA is easier to construct.

9.

http://er.yuvayana.org/difference-between-dfa-nfa-nfa-vs-dfa-automata/ 1/3
4/28/2018 Difference Between DFA NFA | NFA Vs DFA automata | Engineer's Portal

Comparison between Deterministic Finite Automata (DFA)

and the Nondeterministic Finite Automata (NFA):

DFA Vs NFA automata

S.
Title NFA DFA
No.
1. Power Same Same
Not all NFA are DFA.
2. Supremacy All DFA are NFA

Q × ∑→Q, the number

Transition
Maps Q → (∑∪{λ}→2 Q ), the number of of next states is
3. Function
next states is zero or one or more. exactly one

The time needed for

The time needed for executing an
executing an input
input string is more as compare to
4. Time complexity string is less as
DFA.
compare to NFA.

5. Space Less space requires. More space requires.

Time to attempt a Quiz Based on DFA and NFA questions.

http://er.yuvayana.org/difference-between-dfa-nfa-nfa-vs-dfa-automata/ 2/3
4/28/2018 Difference Between DFA NFA | NFA Vs DFA automata | Engineer's Portal

[WpProQuiz 1]

Er Parag Verma
http://www.er.yuvayana.org/

He llo I a m Er P a ra g Ve rm a . I a m te ch b lo g g e r, P ro fe s s o r a nd Entre p re ne ur. I a m o n the m is s io n

to cha ng e the p a tte rn o f le a rning to m a k e it e a s y, va lua b le a nd a d va nce .

http://er.yuvayana.org/difference-between-dfa-nfa-nfa-vs-dfa-automata/ 3/3