# TOC :- Number of states in DFA

323 views
Minimum number of states in DFA where:, Number of a's and Number of b's are even and epsilon is not accepted.Langugae is defined over {a,b}
6

5 states DFA should be minimum,

4 should be the minimum number of states: (even, even) which is final and starting state denoting zero a and b. (even, odd) for even a and odd b. (odd, even) for odd a and even b. (odd,odd) for odd a and odd b.

Make appropriate transitions.

## Related questions

1 vote
1
494 views
Suppose L is a regular language of all a's and b's where the number of a's is divisible by m and the number of b's is divisible by n. If M is the minimal DFA accepting language L, then what is the number of states in M ? Is it nm or (n+1)(m+1) ?
What will be total number of final states in NFA for the given regular expression? $R=(a+b)^{*}b(a+b+\epsilon )$