00:01
What is the number of states required in minimal dfa to accept the string that contains exactly two a's and three b's over the input alphabet ab? a 6, b 11, c 12, or d 13.
00:20
So we need to accept strings that are exactly two a's and three b's.
00:25
So we need to keep track of the number in a's and b's that we've seen in string so far.
00:31
For a's we're going to need three states.
00:35
So for the two a's it's going to be three states.
00:43
There's first state is going to be zero.
00:49
The second state is going to be one.
00:54
And the third state is going to be for two.
01:00
Similarly for b's we need four states.
01:05
So for three b's we need the four states.
01:15
The first one is going to be when b has zero, b equals one, b equals two, and then the third is when b is equal to three...