Scribd
Upload
11 views

Theory of

NFA stands for non-deterministic finite automata. It allows multiple transitions from each state based on the input symbol, unlike DFA which allows only one transition. An NFA can be represented using a state diagram with states as vertices, transitions as arcs labeled with symbols, initial state marked with an arrow and final states denoted by double circles. NFAs are useful for constructing automata for certain languages more easily than DFAs and for proving properties in the theory of computation.

Uploaded by

Aishwarya Rajesh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
11 views

Theory of

NFA stands for non-deterministic finite automata. It allows multiple transitions from each state based on the input symbol, unlike DFA which allows only one transition. An NFA can be represented using a state diagram with states as vertices, transitions as arcs labeled with symbols, initial state marked with an arrow and final states denoted by double circles. NFAs are useful for constructing automata for certain languages more easily than DFAs and for proving properties in the theory of computation.

Uploaded by

Aishwarya Rajesh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 8

THEORY OF

C O M P U T A T I O N

~ KAVIN MARX
AISHWARYA RAJESH
NFA
NFA stands for non-deterministic finite automata. It
is easy to construct an NFA than DFA for a given
regular language.
The finite automata are called NFA when there exist
many paths for specific input from the current state
to the next state.
Every NFA is not DFA, but each NFA can be translated
into DFA.
NFA is defined in the same way as DFA but with the
following two exceptions, it contains multiple next
states, and it contains ε transition.
FORMAL DEFINITION
OF NFA:
NFA also has five states same as DFA, but with
different transition function, as shown follows:

δ: Q x∑ →2Q
where,

1. Q: finite set of states


∑
2. : finite set of the input symbol
3. q0: initial state
4. F: final state
5. δ: Transition function
GRAPHICAL REPRESENTAION OF AN NFA

An NFA can be represented by digraphs called


state diagram. In which:
1. The state is represented by vertices.
2. The arc labeled with an input character
show the transitions.
3. The initial state is marked with an arrow.
4. The final state is denoted by the double
circle.
Example 1
δ(q0, 0) = {q0, q1}
δ(q0, 1) = {q0, q2}
Then, δ(q1, 0) = {q3}
Then, δ(q2, 0) = {q2, q3}
δ(q2, 1) = {q3}
Then, δ(q3, 0) = {q3}
δ(q3, 1) = {q3}
QUESTION

Construct a NFA to accept strings


with either two consecutive 0's or
two concecutive 1's over Σ={0,1}

Let's Solve This!


Applications
Construction of an NFA to recognize a given
language is sometimes much easier than
constructing a DFA for that language.
NFAs used to reduce the complexity of the
mathematical work required to establish many
important properties in the theory of computation.
NFAs is highly applicable to prove closure
properties of regular languages in much easier
way compare to DFA.
.
THANKYOU FOR LISTENING!

SEE YOU MATE.

You might also like