Write a program to convert NDFA to DFA.

#include«Iostream.h»
#include«conio.h»
#include«stdlib.h»
void main()
{
clrscr();
int n=10,A[10][2],init,final;
int temp[10][2];
cout««"Enter no of input";
cin»»n;
for(int i=0;i«n;i++)
{
cout««"Enter transition state for "««i+1««" node";
cout««"(Enter 11 for NULL)\n";
cout««"For a =";
cin»»A[i][1];
cout««"For b =";
cin»»A[i][2];

}
clrscr();
cout««"Entered NFA is\n";
cout««"STATE\t\t"««"a\t"««"b";
for(i=0;i«n;i++)
{ cout««"\nq"««i+1««"\t\t"««"q"««A[i][1]««"\t"««"q"««A[i][2];
}
cout««"\nEnter initial state: ";
cin»»init;
cout««"\nEnter final state: ";
cin»»final;
cout««"\n\n";
cout««" DFA is \n";
cout««"STATE\t\t"««"a\t"««"b\n";
cout««"q"««init««"\t\t"««"q"««A[init-1][1]««"\t"««"q"««A[init-1][2];
temp[init][1]=A[init][1];
temp[init][2]=A[init][2];
getch();
}