Theory Of Computation (2160704)

BE | Semester-7   Winter-2018 | 27/11/2018

Q3) (c)

Write difference between DFA and NDFA. Convert the following NDFA to DFA.

Difference Between DFA and NDFA

Sr Parameter NFA FA
1 Transition Non deterministic Deterministic
2 Power NFA is as powerful as DFA FA is powerful as an NFA
3 Design Easy to design due to non-determinism More difficult to design
4 Acceptance It is difficult to find whether w ∈ L as there are several paths. Backtracking is required to explore several parallel paths. It is easy to find whether w ∈ L as transition are deterministic