search

Mounikachenna12 / Theory-Of-Computation-

0 stars 0 forks source link

DFA SIMULATION #1

Open Mounikachenna12 opened 2 years ago

Mounikachenna12 commented 2 years ago
image

include

include

include

const int final_state=1; void main() { int trans_table[4][2]={{1,2},{1,3},{2,2},{1,3}}; char input_string[20],curr_input,i,l; int present_state,next_state,valid_input; printf("Enter the input string : "); scanf("%s",input_string); l=strlen(input_string); present_state=0; valid_input=1; for(i=0;i<l;i++) { curr_input=input_string[i]; if(curr_input=='a') next_state=trans_table[present_state][0]; else if(curr_input=='b') next_state=trans_table[present_state][1]; else { valid_input=0; break; } present_state=next_state; } if(valid_input==0) printf("Invalid input\n"); else { if(present_state==final_state) printf("The string %s is accepted\n",input_string); else printf("The string %s cannot be accepted\n",input_string); } getch(); }

Mounikachenna12 commented 2 years ago

include

include

include

const int final_state=1; void main() { int trans_table[4][2]={{1,2},{1,3},{2,2},{1,3}}; char input_string[20],curr_input,i,l; int present_state,next_state,valid_input; printf("Enter the input string : "); scanf("%s",input_string); l=strlen(input_string); present_state=0; valid_input=1; for(i=0;i<l;i++) { curr_input=input_string[i]; if(curr_input=='a') next_state=trans_table[present_state][0]; else if(curr_input=='b') next_state=trans_table[present_state][1]; else { valid_input=0; break; } present_state=next_state; } if(valid_input==0) printf("Invalid input\n"); else { if(present_state==final_state) printf("The string %s is accepted\n",input_string); else printf("The string %s cannot be accepted\n",input_string); } getch(); }