Question on minimisation of DFA( DETERMINISTIC FINITE AUTOMATA)

Question

I am working on this project ' minimisation of DFA' plz tell me how can i proceed m making this by using c language.

Answer 1

So for representing i suggest try to implemment a structure with pointers to represent states .

Remember to implement functions like createnewstate() that follow dfa rules.

For minimization try to implemment first algorithms here
https://www.tutorialspoint.com/automata_theory/dfa_minimization.htm

I wanted to be more specific but how you interpret or represent normally will be different from others interpratations. How you will do it is not a exact science.

Answer 2

M having trouble in creating new array every tym n when i needed n having record for every one so that i can check or itrate through every created array