theory of computation

Question

Let sigma = { a,b }. The minimal number of states in a DFA that accepts set of all strings with  

    A) exactly 2 "a's" and more than 2 "b's".

    B) atleast one "a" and exactly 2 "b's" .

Comments

there is no shortcut for this, you have draw both separately, then combine it and later minimize it.

---

@ rude can u please post the answer ...

Answer 1

Answer for exactly 2 "a's" and more than 2 "b's" is 10 states.