00:02
We're asked to construct a deterministic finite state automaton that recognizes the set of all bit strings, ending with 1 -0.
00:16
So first of all, it's going to recognize all the bit strings in the set s, where s is equal to 0, 1 -star, and then 1 -0.
00:44
Now, let's start with a start state, s -0, and we see that the empty string lambda, is not recognized, so it follows that s0 is not a final state.
01:15
Let's consider four more states, or three more states, s1, s2, and s3.
01:23
So s0 is going to represent the last two digits, we're zero, or that there's less than two bits total.
02:00
I guess no bits.
02:09
This is very specific.
02:10
This means that either the first bit was a zero, or there's been no bits yet, or the last two bits were zero -zero.
02:20
It's the more general representation...
