A finite state machine M =

{0, 1} and is determined by the state diagram shown in Fig. 6.5.

(a) Determine the output string for the input string 110111, starting at s0. What is the last transition state?
(b) Answer part (a) for the same string but with s as the starting state. What about si and s3 as starting states?
(c) Find the state table for this machine.
(d) In which state should we start so that the input string 10010 produces the output 10000?
(e) Determine an input string

of minimal length, such that v(s4, x) = s1. Is x unique?

(S,J, 0, , ) has j =0 = 0, 0 0, 0 1, 0 1, 1 So $1 S2 Start 0, 0 0, 0 0, 1 Figure 6.5