CODEWITHSUNDEEP
automatadfanfa
Waqar Danish
Waqar Danish

Reputation: 83

Which is more powerful??DFA or NFA?

NFA is similar to DFA except following additional features:

  1. Null (or ε) move is allowed i.e., it can move forward without reading symbols.

  2. Ability to transit to any number of states for a particular input. However, these above features don’t add any power to NFA. If we compare both in terms of power, both are equivalent.

Is this statement correct?If so,then what is the need of NFAs when we already have DFAs??

Upvotes: 2

Views: 4286

Answers (1)

Pronoy999
Pronoy999

Reputation: 660

DFA are powerful and they are definite, unlike NFA. But when you are given a problem it is very easy to create the solution using NFA since you don't have to handle everything. But you can't create an automaton machine using that. To create automata you need DFA. It's not very difficult to convert from NFA to DFA. But to directly approach DFA is very tough. You can obviously do it, but it's not that easy. Hence we have NFA to first approach the problem and then when we choose to make the automata we convert that NFA to DFA and then create the machine, which is far more easier according to me.

Upvotes: 3

Related Questions