Differences between NFA and DFA
| S.no. | Title | NFA | DFA |
|---|---|---|---|
| 1. | Abbreviation | Non deterministic finite automata | Deterministic finite automata |
| 2. | Purpose | In NFA, The Transition function maps on at least one state for valid input symbol. | In DFA, The Transition function maps on at most one state for valid input symbol. |
| 3. | Power | same | same |
| 4. | Transition Function | δ : Q X Σ –> 2 ^ Q. | δ : Q X Σ –> Q. |
| 5. | Time Complexity | The time needed for executing an input string is more | The time needed for executing an input string is less. |
| 6 | Supremacy | All DFAs are NFA but not all NFAs are DFA | All DFAs are NFA. |
