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 whenever the input pattern 011 occurs.
(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.