The document defines DFA and NFA, and discusses why NFA is studied. It provides definitions for both DFA and NFA, noting that DFA is deterministic with a single next state, while NFA is non-deterministic and can have multiple next states. NFA is easier to design but not practically implemented. The formal definition of NFA is given as a 5-tuple consisting of states, input symbols, initial state, final states, and a transition function that maps a state and input to a set of possible next states.

1. PRESENTED BY:
SUNIL KUMAR
ASST PROFESSOR
MCA
NFA

2. What is DFA?
• DFA Stands for Deterministic finite automata i.e. Where everything is finite
and well determine.
Q2Q1
S(Q1,a) = Q2
a

3. What is NFA?
Q2
Q1
Q3
• N-DFA Stands Non-Deterministic finite automata i.e. it contains multiple next states.
S(Q1,a) = (Q1,Q2)
a
a

4. Why we are studying N-DFA?
• We study it because it is easy to design as compared to DFA, but is not practically
implemented.
NFA
DFA
MDFA

5. NFA formal Definition
• NFA consist of 5 Tuple: N-DFA = (Q,∑ ,q0, F, δ)
• Q: finite set of states
• ∑: finite set of the input symbol
• q0: initial state
• F: final state
• δ: Transition function
• δ: Q x ∑ →2Q (Power Set)
Total states = (q1,q2)
{q0,q1}= (^,q0,q1,{q0,q1})
22 =4

6. Thank You