I am trying to solve a problem on DFA . What will be the minimum number of states for the following regular language .L={x is a element of {a,b}*,|x|=n and number of a is equal to number of b}I have calculated the answer as 3.2^(n/2)-1 . Just need to verify it is minimal or not ? Please Help !Here is the DFA I created for n=4
Minimal DFA number of states
automata;finite automata