How is different an NFA from a DFA?


The difference between an NFA (non-deterministic finite state automaton) and a DFA (deterministic finite state automaton) is that while in the former we can have more than one transition with the same label from the same state, in the latter each label has only one transition associated with it.

Looking for more help? Search our library of answers.👇

Need help with Computing?
Boost your grades with stress-free tuition that fits your schedule.
Michelangelo P.

About the author

Michelangelo P. is an online Computing tutor with MyTutor studying at Manchester University