DFA |
NDFA |

In DFA transition, we know the next state will be—it is determined. Therefore; it is known as *deterministic* |
In NDFA transition, the next states can be multiple for each input symbol. Therefore; it is known as *non-deterministic* |

Every deterministic finite automaton is automatically a nondeterministic finite automaton |
Every nondeterministic finite automaton is not a deterministic finite automaton |

Empty string transitions are not seen in DFA. |
Empty string permited in NFA |

Backtracking is possible |
Backtracking is not always allowed. |

Need more space. |
Need less space. |

**string accepted:** final state transits also. |
**string accepted:** In a final state, At least one of all possible transitions ends |