Compiler Design Course Assignment #1 10%

Show that DFA for all strings of a’s and b’s that contain an even number of a’s and an even
number of b’s is:

NB: You can use regular expression, NFA, DFA, DFA Minimization and properties of Finite State
Automata (FSA) to show your prove.
Caution: Direct copying from other student is highly forbidden. Results in 0 mark