How to convert NFA to DFA (Using Subset Construction Method)
Steps or Procedure
of converting NFA to DFA:
1)
Construct state diagram of NFA
2)
Draw transition table of NFA diagram.
3)
Draw transition table of DFA from NFA transition table.
4)
Construct DFA state diagram.
Note: Every dead configuration in NFA
i.e. ∅ must
be translated into dead state(trap state) in DFA
Example-01: Convert the given
NFA which accepts the language L={ Strings starts with ‘a’ } Over ∑={a,b}
SOLUTION:
Step-1: Transition
diagram of NFA
Step-2:Transition
table of NFA:
Present State
|
Next State
|
|
Input a
|
Input b
|
|
à q0
|
{q1}
|
∅
|
*q1
|
{ q1}
|
{q1}
|
Step-3:Transition
table of DFA:
Present State
|
Next State
|
|
Input a
|
Input b
|
|
à q0
|
[q1]
|
D
|
*q1
|
[q1]
|
[q1]
|
D
|
D
|
D
|
Step-4:Transition diagram
of DFA:
In DFA we have only one path but in this solution you have mentioned multiple paths, how?
ReplyDeleteidk
Delete