69 views

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

1. $9$
2. $10$
3. $16$
4. None
edited | 69 views
0
Is it 10 state??

+1 vote

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.

there will be 10 states in dfa

0
Which are final states ?
0
9 is final state