-
Notifications
You must be signed in to change notification settings - Fork 0
/
dfa.c
71 lines (63 loc) · 1.62 KB
/
dfa.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
int main(){
int n,sym,i,j,k,initialState,flag=0,temp=0;
// TAKING DFA INPUTS
printf("Enter the number of States: ");
scanf("%d",&n);
printf("Enter the number of Symbols: ");
scanf("%d",&sym);
printf("Enter the Transitions\n");
int states[n][sym];
for(i=0;i<n;i++){
for(j=0;j<sym;j++){
printf("On %d input enter transition state for state S%d: ",j,i);
scanf("%d",&states[i][j]);
if(states[i][j]>=n){
j--;
printf("Error!!\nNot a Valid State\n");
}
}
}
// CHECKING STRING IN DFA
printf("Enter Initial State: ");
scanf("%d",&initialState);
char finalStates[100];
printf("Enter Final States: ");
scanf("%s",&finalStates);
while(1){
char input[100];
printf("Enter a String to check: ");
scanf("%s",&input);
int curr;
int l = (int)strlen(input);
//CHECKING IF STRING IS VALID OR NOT
for(i=0;i<l;i++){
if((int)input[i]-48>=sym){
printf("Not A Valid String!! \nTry Again!!\n\n");
temp=-1;
break;
}
}
if(temp==-1){continue;}
// NOW CHECKING IF STRING IS ACCEPTED IN DFA OR NOT
for(i=0;i<l;i++){
curr = (int)input[i]-48;
flag = states[flag][curr];
}
l = (int)strlen(finalStates);
for(i=0;i<l;i++){
if(flag==(int)finalStates[i]-48){
printf("******************************\nString Accepted in DFA\n******************************\n\n");
temp=1;
break;
}
}
if(!temp){
printf("******************************\nString was NOT Accepted by DFA\n******************************\n\n");
temp=0;
}
}
return 0;
}