8/29/22, 7:11 PM Converting NFA to DFA | Solved Examples | Gate Vidyalay

Converting NFA to DFA | Solved

Examples
Theory of Automata & Computation

Non-Deterministic Finite Automata-

 

Before you go through this article, make sure that you

have gone through the previous article on Non-
Deterministic Finite Automata.

In Non-Deterministic Finite Automata,

For some current state and input symbol, there

exists more than one next output states.
A string is accepted only if there exists at least one
transition path starting at initial state and ending at
final state.

In this article, we will discuss how to convert a given

NFA to a DFA.

Converting NFA to DFA-

 

The following steps are followed to convert a given NFA

to a DFA-

Step-01:
 

Let Q’ be a new set of states of the DFA. Q’ is null

in the starting.
Let T’ be a new transition table of the DFA.

Step-02:
 

Add start state of the NFA to Q’.

https://www.gatevidyalay.com/converting-nfa-to-dfa-solved-examples/ 1/14
8/29/22, 7:11 PM Converting NFA to DFA | Solved Examples | Gate Vidyalay

Add transitions of the start state to the transition

table T’.
If start state makes transition to multiple states for
some input alphabet, then treat those multiple
states as a single state in the DFA.

In NFA, if the transition of start state over some input

alphabet is null,

then perform the transition of start state over that

input alphabet to a dead state in the DFA.

Step-03:
 

If any new state is present in the transition table T’,

Add the new state in Q’.

Add transitions of that state in the transition table
T’.

Step-04:
 

Keep repeating Step-03 until no new state is present in

the transition table T’.

Finally, the transition table T’ so obtained is the

complete transition table of the required DFA.

PRACTICE PROBLEMS BASED ON

CONVERTING NFA TO DFA-
 

Problem-01:
 

Convert the following Non-Deterministic Finite Automata

(NFA) to Deterministic Finite Automata (DFA)-

https://www.gatevidyalay.com/converting-nfa-to-dfa-solved-examples/ 2/14
8/29/22, 7:11 PM Converting NFA to DFA | Solved Examples | Gate Vidyalay

Solution-
 

Transition table for the given Non-Deterministic Finite

Automata (NFA) is-

State /
a b
Alphabet

→q0 q0 q0, q1

q1 – *q2

*q2 – –

Step-01:
 

Let Q’ be a new set of states of the Deterministic Finite

Automata (DFA).

Let T’ be a new transition table of the DFA.

Step-02:
 

Add transitions of start state q0 to the transition table T’.

State /
a b
Alphabet

https://www.gatevidyalay.com/converting-nfa-to-dfa-solved-examples/ 3/14
8/29/22, 7:11 PM Converting NFA to DFA | Solved Examples | Gate Vidyalay

→q0 q0 {q0, q1}

Step-03:
 

New state present in state Q’ is {q0, q1}.

Add transitions for set of states {q0, q1} to the transition

table T’.

State /
a b
Alphabet

→q0 q0 {q0, q1}

{q0, q1} q0 {q0, q1, q2}

Step-04:
 

New state present in state Q’ is {q0, q1, q2}.

Add transitions for set of states {q0, q1, q2} to the

transition table T’.

State /
a b
Alphabet

→q0 q0 {q0, q1}

{q0, q1} q0 {q0, q1, q2}

{q0, q1, q2} q0 {q0, q1, q2}

Step-05:
 

https://www.gatevidyalay.com/converting-nfa-to-dfa-solved-examples/ 4/14
8/29/22, 7:11 PM Converting NFA to DFA | Solved Examples | Gate Vidyalay

Since no new states are left to be added in the transition

table T’, so we stop.

States containing q2 as its component are treated as

final states of the DFA.

Finally, Transition table for Deterministic Finite Automata

(DFA) is-

State /
a b
Alphabet

→q0 q0 {q0, q1}

{q0, q1} q0 *{q0, q1, q2}

*{q0, q1, q2} q0 *{q0, q1, q2}

Now, Deterministic Finite Automata (DFA) may be

drawn as-

Problem-02:
 

Convert the following Non-Deterministic Finite Automata

(NFA) to Deterministic Finite Automata (DFA)-

https://www.gatevidyalay.com/converting-nfa-to-dfa-solved-examples/ 5/14
8/29/22, 7:11 PM Converting NFA to DFA | Solved Examples | Gate Vidyalay

Solution-
 

Transition table for the given Non-Deterministic Finite

Automata (NFA) is-

State /
0 1
Alphabet

→q0 q0 q1, *q2

q1 q1, *q2 *q2

*q2 q0, q1 q1

Step-01:
 

Let Q’ be a new set of states of the Deterministic Finite

Automata (DFA).

Let T’ be a new transition table of the DFA.

Step-02:
 

Add transitions of start state q0 to the transition table T’.

https://www.gatevidyalay.com/converting-nfa-to-dfa-solved-examples/ 6/14
8/29/22, 7:11 PM Converting NFA to DFA | Solved Examples | Gate Vidyalay

State / 0 1
Alphabet

→q0 q0 {q1, q2}

Step-03:
 

New state present in state Q’ is {q1, q2}.

Add transitions for set of states {q1, q2} to the transition

table T’.

State /
0 1
Alphabet

→q0 q0 {q1, q2}

{q1, q2} {q0, q1, q2} {q1, q2}

Step-04:
 

New state present in state Q’ is {q0, q1, q2}.

Add transitions for set of states {q0, q1, q2} to the

transition table T’.

State /
0 1
Alphabet

→q0 q0 {q1, q2}

{q1, q2} {q0, q1, q2} {q1, q2}

{q0, q1, q2} {q0, q1, q2} {q1, q2}

Step-05:

https://www.gatevidyalay.com/converting-nfa-to-dfa-solved-examples/ 7/14
8/29/22, 7:11 PM Converting NFA to DFA | Solved Examples | Gate Vidyalay

Since no new states are left to be added in the transition

table T’, so we stop.

States containing q2 as its component are treated as

final states of the DFA.

Finally, Transition table for Deterministic Finite Automata

(DFA) is-

State /
0 1
Alphabet

→q0 q0 *{q1, q2}

*{q1, q2} *{q0, q1, q2} *{q1, q2}

*{q0, q1, q2} *{q0, q1, q2} *{q1, q2}

Now, Deterministic Finite Automata (DFA) may be

drawn as-

Problem-03:
 

Convert the following Non-Deterministic Finite Automata

(NFA) to Deterministic Finite Automata (DFA)-

https://www.gatevidyalay.com/converting-nfa-to-dfa-solved-examples/ 8/14
8/29/22, 7:11 PM Converting NFA to DFA | Solved Examples | Gate Vidyalay

Solution-
 

Transition table for the given Non-Deterministic Finite

Automata (NFA) is-

State /
a b
Alphabet

→q0 *q1, q2 –

*q1 – –

q2 *q1, q2 q2

Step-01:
 

Let Q’ be a new set of states of the Deterministic Finite

Automata (DFA).

Let T’ be a new transition table of the DFA.

Step-02:
 

Add transitions of start state q0 to the transition table T’.

https://www.gatevidyalay.com/converting-nfa-to-dfa-solved-examples/ 9/14
8/29/22, 7:11 PM Converting NFA to DFA | Solved Examples | Gate Vidyalay

State / a b
Alphabet

Ø (Dead
→q0 {q1, q2}
State)

Step-03:
 

New state present in state Q’ is {q1, q2}.

Add transitions for set of states {q1, q2} to the transition

table T’.

State /
a b
Alphabet

→q0 {q1, q2} Ø

{q1, q2} {q1, q2} q2

Step-04:
 

New state present in state Q’ is q2.

Add transitions for state q2 to the transition table T’.

State /
a b
Alphabet

→q0 {q1, q2} Ø

{q1, q2} {q1, q2} q2

q2 {q1, q2} q2

Step-05:

https://www.gatevidyalay.com/converting-nfa-to-dfa-solved-examples/ 10/14
8/29/22, 7:11 PM Converting NFA to DFA | Solved Examples | Gate Vidyalay

Add transitions for dead state {Ø} to the transition table

T’.

State /
a b
Alphabet

→q0 {q1, q2} Ø

{q1, q2} {q1, q2} q2

q2 {q1, q2} q2

Ø Ø Ø

Step-06:
 

Since no new states are left to be added in the transition

table T’, so we stop.

States containing q1 as its component are treated as

final states of the DFA.

Finally, Transition table for Deterministic Finite Automata

(DFA) is-

State /
a b
Alphabet

→q0 *{q1, q2} Ø

*{q1, q2} *{q1, q2} q2

q2 *{q1, q2} q2

Ø Ø Ø

https://www.gatevidyalay.com/converting-nfa-to-dfa-solved-examples/ 11/14
8/29/22, 7:11 PM Converting NFA to DFA | Solved Examples | Gate Vidyalay

Now, Deterministic Finite Automata (DFA) may be

drawn as-

Important Points-
 

It is important to note the following points when

converting a given NFA into a DFA-

Note-01:
 

After conversion, the number of states in the

resulting DFA may or may not be same as NFA.
The maximum number of states that may be
present in the DFA are 2Number of states in the NFA.

Note-02:
 

In general, the following relationship exists between the

number of states in the NFA and DFA-

https://www.gatevidyalay.com/converting-nfa-to-dfa-solved-examples/ 12/14
8/29/22, 7:11 PM Converting NFA to DFA | Solved Examples | Gate Vidyalay

1 <= n <= 2m

Here,

n = Number of states in the DFA

m = Number of states in the NFA

Note-03:
 

In the resulting DFA, all those states that contain

the final state(s) of NFA are treated as final states.

To gain better understanding about Converting NFA to

DFA,

Watch this Video Lecture

Next Article- Parse Tree | Derivations

Get more notes and other study material of Theory of

Automata and Computation.

Watch video lectures by visiting our YouTube channel

LearnVidFun.

Summary

https://www.gatevidyalay.com/converting-nfa-to-dfa-solved-examples/ 13/14
8/29/22, 7:11 PM Converting NFA to DFA | Solved Examples | Gate Vidyalay

Article Name Converting NFA to DFA | Solved

Examples

Description Converting NFA to DFA- A given

NFA is converted into a DFA using
the mentioned steps. Practice
Problems on NFA to DFA
Conversion are discussed.
Converting NFA to DFA Solved
Examples.

Author Akshay Singhal

Publisher Name Gate Vidyalay

Publisher Logo

https://www.gatevidyalay.com/converting-nfa-to-dfa-solved-examples/ 14/14