Differentiate between NFA and DFA.

34kviews

written 9.4 years ago by

teamques10 ★ 70k

modified 3.8 years ago by

pedsangini276 • 4.8k

Mumbai university > Comp > SEM 4 > TCS

Marks: 5M

Year: May 2015

theory of computation

ADD COMMENT EDIT

1 Answer

390views

written 9.4 years ago by

teamques10 ★ 70k

NFA	DFA
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 …

Create a free account to keep reading this post.

and 2 others joined a min ago.

ADD COMMENT EDIT

Please log in to add an answer.