Difference between DFA and NDFA in Tabular Form

1DFA stands for deterministic finite
NDFA stands for non-deterministic
finite automata.
2when 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.
3DFA can not use empty string transition.NDFA can use empty string transition.
4In 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.
5For 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.
6DFA can understood as one machine.NDFA can be understood as multiple title machines computing at the same time.
7DFA will reject the string if it end at other than accepting stateIf all the branches of NDFA dies or rejects the string, we can say that NDFA reject the string.
8It is more difficult to construct DFA.NDFA is easier to construct.
9DFA requires more space.NDFA requires less space.
10For every input and output we can construct DFA machine.It is not possible to construct an NDFA machine for every input and output.
(Visited 971 times, 4 visits today)

Written by:
Translate »