retagged by
1,242 views
0 votes
0 votes
Find the number of states in minimized DFA that accepts languages over sigma={a,b},where each string has exactly three a’s and two b’s.
retagged by

1 Answer

3 votes
3 votes
5 state in exactly three a's and 4 state in at least two b

After removing dead state we get 4 and 3 state

So 4*3 = 12 and one for dead state total 13 state

Related questions