Scribd
Upload
251 views9 pages

Class 11 converting NFA with ε to DFA

Uploaded by

midhulasrikj3053
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
251 views9 pages

Class 11 converting NFA with ε to DFA

Uploaded by

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

converting NFA with ε to DFA:

Steps for converting NFA with ε to DFA:

Step 1: We will take the ε-closure for the starting state of NFA as a
starting state of DFA.

Step 2: Find the states for each input symbol that can be traversed
from the present. That means the union of transition value and
their closures for each state of NFA present in the current state of
DFA.

Step 3: If we found a new state, take it as current state and repeat


step 2.
Step 4: Repeat Step 2 and Step 3 until there is no new state
present in the transition table of DFA.
Step 5: Mark the states of DFA as a final state which contains the
final state of NFA.
Convert the NFA with ε into its equivalent DFA.

Solution:
Let us obtain ε-closure of each state.
ε-closure {q0} = {q0, q1, q2}
ε-closure {q1} = {q1}
ε-closure {q2} = {q2}
ε-closure {q3} = {q3}
ε-closure {q4} = {q4}

Now, let ε-closure {q0} = {q0, q1, q2} be state A.


Hence

δ'(A, 0) = ε-closure {δ((q0, q1, q2), 0) }


= ε-closure {δ(q0, 0) ∪ δ(q1, 0) ∪ δ(q2, 0) }
= ε-closure {q3}
= {q3} call it as state B.

δ'(A, 1) = ε-closure {δ((q0, q1, q2), 1)

= ε-closure {δ((q0, 1) ∪ δ(q1, 1) ∪ δ(q2, 1) }


= ε-closure {q3}
= {q3} = B.
Now,

δ'(B, 0) = ε-closure {δ(q3, 0) }


=ϕ The DFA will be,
δ'(B, 1) = ε-closure {δ(q3, 1) }
= ε-closure {q4}
= {q4} i.e. state C

For state C:

δ'(C, 0) = ε-closure {δ(q4, 0) }


=ϕ
δ'(C, 1) = ε-closure {δ(q4, 1) }
=ϕ
Convert the given NFA into its equivalent DFA.

Solution: Let us obtain the ε-closure of each state.

ε-closure(q0) = {q0, q1, q2}


ε-closure(q1) = {q1, q2}
ε-closure(q2) = {q2}

Now we will obtain δ' transition. Let ε-closure(q0) = {q0, q1, q2}
call it as state A.
δ'(A, 0) = ε-closure{δ((q0, q1, q2), 0)}
= ε-closure{δ(q0, 0) ∪ δ(q1, 0) ∪ δ(q2, 0)}
= ε-closure{q0}
= {q0, q1, q2}

δ'(A, 1) = ε-closure{δ((q0, q1, q2), 1)}


= ε-closure{δ(q0, 1) ∪ δ(q1, 1) ∪ δ(q2, 1)}
= ε-closure{q1}
= {q1, q2} call it as state B

δ'(A, 2) = ε-closure{δ((q0, q1, q2), 2)}


= ε-closure{δ(q0, 2) ∪ δ(q1, 2) ∪ δ(q2, 2)}
= ε-closure{q2}
= {q2} call it state C

Thus we have obtained


δ'(A, 0) = A
δ'(A, 1) = B
δ'(A, 2) = C
Now we will find the transitions on states B and C for each input.
Hence

δ '(B, 0) = ε-closure{δ((q1, q2), 0)}


= ε-closure{δ(q1, 0) ∪ δ(q2, 0)}
= ε-closure{ϕ}
=ϕ

δ'(B, 1) = ε-closure{δ((q1, q2), 1)}


= ε-closure{δ(q1, 1) ∪ δ(q2, 1)}
= ε-closure{q1}
= {q1, q2} i.e. state B itself

δ'(B, 2) = ε-closure{δ((q1, q2), 2)}


= ε-closure{δ(q1, 2) ∪ δ(q2, 2)}
= ε-closure{q2}
= {q2} i.e. state C itself

Thus we have obtained


δ'(B, 0) = ϕ
δ'(B, 1) = B
δ'(B, 2) = C
Now we will obtain transitions for C:
δ'(C, 0) = ε-closure{δ(q2, 0)}
= ε-closure{ϕ}
=ϕ

δ'(C, 1) = ε-closure{δ(q2, 1)}


= ε-closure{ϕ}
=ϕ

δ'(C, 2) = ε-closure{δ(q2, 2)}


= {q2}

Hence the DFA is

As A = {q0, q1, q2} in which final state q2 lies hence A is final state. B = {q1, q2} in
which the state q2 lies hence B is also final state. C = {q2}, the state q2 lies hence C is
also a final state.

You might also like