The document describes how to convert a non-deterministic finite automaton (NFA) to a deterministic finite automaton (DFA). It involves constructing the power set of the NFA states and using epsilon-closure to determine the transitions. The procedure is demonstrated with examples. C source code is also provided to implement the NFA to DFA conversion algorithm.
The document describes how to convert a non-deterministic finite automaton (NFA) to a deterministic finite automaton (DFA). It involves constructing the power set of the NFA states and using epsilon-closure to determine the transitions. The procedure is demonstrated with examples. C source code is also provided to implement the NFA to DFA conversion algorithm.
The document describes how to convert a non-deterministic finite automaton (NFA) to a deterministic finite automaton (DFA). It involves constructing the power set of the NFA states and using epsilon-closure to determine the transitions. The procedure is demonstrated with examples. C source code is also provided to implement the NFA to DFA conversion algorithm.
The document describes how to convert a non-deterministic finite automaton (NFA) to a deterministic finite automaton (DFA). It involves constructing the power set of the NFA states and using epsilon-closure to determine the transitions. The procedure is demonstrated with examples. C source code is also provided to implement the NFA to DFA conversion algorithm.
Conversion of NFA to DFA Let M2 = < Q2 , , , q2,0 , , A2 > be an NFA that recognizes a language L. Then the DFA M = < Q, , q0
, A > that satisfies the following conditions recognizes L:
Q = 2Q2 , that is the set of all subsets of Q2 , q0 = { q2,0 } , ( q, a ) = A={q Q|q A2 for each state q in Q and each symbol a in } and
To obtain a DFA M = < Q, , q2,0 ,
2
, q0 ,
, A > which accepts the same language as the given NFA M2 = < Q2 ,
, A2 > does, you may proceed as follows:
Initially Q = . First put { q2,0 } into Q. { q2,0 } is the initial state of the DFA M. Then for each state q in Q do the following: add the set each symbol a in . ( q, a ) = to , where the on the right hand side is that of , where here is that of NFA M2, as a state to Q if it is not already in Q for
For this new state, add NFA M2.
When no more new states can be added to Q, the process terminates. All the states of Q that contain accepting states of M2 are accepting states of M. Note: The states that are not reached from the initial state are not included in Q obtained by this
procedure. Thus the set of states Q thus obtained is not necessarily equal to 2Q2 .
Example 1: Let us convert the following NFA to DFA.
Initially Q is empty. Then since the initial state of the DFA is {0} , {0} is added to Q. Since Since 2(
0 , a ) = { 1 , 2 } , { 1 , 2 } is added to Q and 0,b)= , is added to Q and }.
({0},a)={1,2}. .
2(
({0},b)=
At this point Q = { {0} , { 1 , 2 },
Then since { 1 , 2 } is now in Q, the transitions from { 1 , 2 } on symbols a and b are computed. Since 1 , a ) = { 1 , 2 } , and 1 , 3 } is added to Q . 2(
2(
2,a)=
( { 1 , 2 } , a ) = { 1 , 2 } . Similarly
( { 1 , 2 } , b ) = { 1 , 3 } . Thus {
Similarly ( { 1 , 3 } , a ) = { 1 , 2 } and ( { 1 , 3 } , b ) = . Thus no new states are added to Q . Since the transitions from all states of Q have been computed and no more states are added to Q, the conversion process stops here.
Note that there are no states of Q2 in
. Hence there are no states that M2 can go to from
. Hence
,a)=
,b)=
For the accepting states of M, since states 0 and 1 are the accepting states of the NFA, all the states of Q that contain 0 and/or 1 are accepting states. Hence { 0 }, { 1 , 2 } and { 1 , 3 } are the accepting states of M.
The DFA thus obtained is shown below.
Example 2: Similarly the NFA
is converted to the following DFA:
Test Your Understanding of Conversion of NFA to DFA
Indicate which of the following statements are correct and which are not. Click Yes or No , then Submit. There are two sets of questions. Answer the questions below on converting the following NFA to DFA.
The following notation is used in the questions: : \delta
Converting NFA To DFA Compile Design in C Source Code Programming
Include the Necessary Package, Declare the variable in array. I use the checke(char a), push(char a), pop(),pushd(char *a) function to perform the NFA to DFA conversion. Algorithm Source Code NFA to DFA Example #include<iostream.h> #include<string.h> #include<stdio.h> #include<conio.h> #include<stdlib.h> char nfa[50][50],s[20],st[10][20],eclos[20],input[20]; int x,e,top=0,topd=0,n=0,ns,nos,in; int checke(char a) { int i; for(i=0;i<e;i++) { if(eclos[i]==a) return i;
} return -1; } int check(char a) { int i; for(i=0;i<in;i++) { if(input[i]==a) return i; } return -1; } void push(char a) { s[top]=a; top++; } char pop() { top--; return s[top]; } void pushd(char *a) { strcpy(st[topd],a); topd++; } char *popd() { topd--; return st[topd]; } int ctoi(char a) { int i=a-48; return i; } char itoc(int a) { char i=a+48;
{ if(b[0]!='\0') { nos++; pushd(b); strcpy(dstates[nos],b); } } cout<<b<<"\t"; } cout<<endl; } getch(); } OUTPUT NFA to DFA Example Enter the number of states 5 Move[0][0]Move[0][1]e Move[0][2]Move[0][3]e Move[0][4]Move[1][0]Move[1][1]Move[1][2]a Move[1][3]Move[1][4]Move[2][0]Move[2][1]e Move[2][2]Move[2][3]e Move[2][4]Move[3][0]Move[3][1]Move[3][2]Move[3][3]Move[3][4]b Move[4][0]Move[4][1]Move[4][2]-
Enter the number of states 6 Move[0][0]Move[0][1]a Move[0][2]Move[0][3]Move[0][4]Move[0][5]Move[1][0]Move[1][1]Move[1][2]b Move[1][3]Move[1][4]Move[1][5]Move[2][0]Move[2][1]Move[2][2]Move[2][3]a Move[2][4]e Move[2][5]Move[3][0]Move[3][1]Move[3][2]c Move[3][3]Move[3][4]e ab 01 1 24 24 3244 5
