Minimizing DFA C Program

August 29, 2017 | Author: rnspace | Category: N/A
Share Embed Donate


Short Description

C Program To minimize the given Finite Automata...

Description

#include #include #include void getInputs(); void defineGroups(int); int isGroupDefined(char); int isInitialState(char); int isFinalState(char); void removeFromDFA(char,char); int posofstate(char); void DFAOutput(); char G[]="({A,B,C,D,E,F,G,H},{a,b},{A},{E})",DFA_initial[50],DFA_final [50]; char *DFA_NT[50], *DFA_T[50], *DFA_Tab[50][50]; char groups[50][50], groupedStates[50]; int DFA_NTlen,DFA_Tlen,totalGrouped,totalGroup,GSlen; int main(void) { int i; totalGrouped=0; totalGroup=0; GSlen=0; getInputs(); for(i=0;i
View more...

Comments

Copyright ©2017 KUPDF Inc.
SUPPORT KUPDF