Difference Between DFA and NDFA in Tabular Form
| Sr.no | DFA | NDFA |
| 1 | DFA stands for deterministic finite automata. | NDFA stands for non-deterministic finite automata. |
| 2 | when processing a string in DFA , there is always a unique state to go next when each character is read. It is because for each state in DFA , there is exactly one state that corresponds to each character being read. | In NDFA several choices may exist for the next state. Can move to more than one states. |
| 3 | DFA can not use empty string transition. | NDFA can use empty string transition. |
| 4 | In DFA we cannot move from one state to another without consuming a symbol. | NDFA allows € (null) as the second argument of the transition function. This means that the NDFA can make a transition without consuming an input symbol. |
| 5 | For every symbol of the alphabet, there is only one state transition in DFA. | We do not need to specify how does the NDFA react according to some symbol. |
| 6 | DFA can understood as one machine. | NDFA can be understood as multiple title machines computing at the same time. |
| 7 | DFA will reject the string if it end at other than accepting state | If all the branches of NDFA dies or rejects the string, we can say that NDFA reject the string. |
| 8 | It is more difficult to construct DFA. | NDFA is easier to construct. |
| 9 | DFA requires more space. | NDFA requires less space. |
| 10 | For every input and output we can construct DFA machine. | It is not possible to construct an NDFA machine for every input and output. |
(Visited 14,479 times, 1 visits today)
Written by: