Finite state machines can be used to detect the occurrence of certain subsequences in the sequence of binary inputs applied to the machine. Such machines are called finite state recognizers. Suppose that a machine is to produce a 1 as its output coincident with the second 1 in the pattern 011 whenever that subsequence occurs in the input sequence applied to the machine.

(a) Draw the state diagram for this machine.

(b) Make a state assignment for the required number of flip-flops and construct the assigned state table, assuming that D flip-flops are to be used.

(c) Derive the logic expressions for the output and the next-state variables.

LO1