Toc DFA

Question

The minimum number of state in the DFA for the language $L = \{ w \mid w \in \{a,b\}^* \text{ w has exactly two a's and at least two b's} \}$ is 

• A. $9$
• B. $10$
• C. $16$
• D. None

Comments

Is it 10 state??

Answer 1

As we can see there are two language ,one exactly two a's and other at least 2 b ,so in first lang after getting 2 a's , onwards 3rd a should not be accepted so there is trap state and for second after getting 2 b's ,any no. Of b's are accepted.

Answer 2

there will be 10 states in dfa 

Comments

Which are final states ?

---

9 is final state