00:01
We're asked to construct a finite state machine that determines whether the word computer has been read as the last eight characters, since computer is eight characters long, in the input read so far, where the input can be any string of english letters.
00:22
So to start off, we're told that the input is a string of english letters.
00:26
And now let's consider the nine states, s0, s1, s2, s3, s4, s5, s6, s7, and s8.
01:01
So s0 is a start state, and s0 is going to represent the fact that no letters were processed yet, or the fact that the last letter processed was not a c.
01:53
S2 represents the last letters, or sorry, s1 represents the last letter was a c.
02:16
S2 represents the last letters were c o.
02:32
S3 represents that the last letters were com...