Theory Of Computation (2160704)

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

Q5) (a)

Compare FA, NFA and NFA-^

Sr Parameter NFA FA NFA-^
1 Transition Non deterministic Deterministic Non deterministic
2 Power NFA is as powerful as DFA FA is powerful as an NFA It’s powerful as FA
3 Design Easy to design due to non-determinism More difficult to design Allow flexibility in handling NFA problem
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 ^-transition is useful in constructing a composite FA with respect to union, concatenation, and star