Differentiate between NFA and DFA.

Mumbai university > Comp > SEM 4 > TCS

Marks: 5M

Year: May 2015

Deterministic Finite Automaton is a FA in which there is only one path for a specific input from current state to next state. There is a unique transition on each input symbol. NFA or Non Deterministic Finite Automaton is the one in which there exists many paths for a specific input from current state to next state.
DFA cannot use Empty String transition NFA can use Empty String transition.
DFA can be understood as one machine NFA can be understood as multiple little machines computing at the same time.
DFA will reject the string if it end at other than accepting state If all of the branches of NFA dies or rejects the string, we can say that NFA reject the string.
For Every symbol of the alphabet, there is only one state transition in DFA. We do not need to specify how the NFA reacts according to some symbol.
Please log in to add an answer.

Next up

Read More Questions

If you are looking for answer to specific questions, you can search them here. We'll find the best answer for you.


Study Full Subject

If you are looking for good study material, you can checkout our subjects. Hundreds of important topics are covered in them.

Know More