Question

What is the number of states required in minimal DFA to accept the strings of a regular langu:
that contains exactly 2 a's and 3 b's over the input alphabet {a, b}?
​

Answer 1

What is the number of states required in minimal DFA to accept the strings of a regular langu:

that contains exactly 2 a's and 3 b's over the input alphabet {a, b}?

Explanation:

Language will usually consists of 12 length strings, to get one such string, one can choose any five spot for a's and rest 7 spot will be for b's. Becausw one needs ( 3 * 3 + 1 ) = 10 states for 2 a's and 2 b's