Let M =

determined by the state diagram shown in Fig. 6.7.

(a) Find the output for the input string x = 0110111011.
(b) Give the transition table for this finite state machine.
(c) Starting in state s0, if the output for an input string x is 0000001, determine all possibilities for x.
(d) Describe in words what this finite state machine does.

Transcribed Image Text:

(S, g, C, v, ω) C = {0. 1} and S, v, and ω 0, 0 0, 0 0, 0 1,010 Start11 Si 53 1, 0 1, 0 0, 0 0, 0 0, 0 Figure 6.7