Question

What is the number of states required in minimal DFA to accept the strings of a regular language
that contains exactly 2 a's and 3 b's over the input alphabet {a, b}?
(A) 6
(B) 11
(C) 12
(D) 13

What is the answer​

Answer 1

Answer:

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