Use a Finite State Machine (FSM) to solve the following problem: You are asked to design the following 4-number sequence detector. A sequence detector receives integers at its input, one integer at a time. Inputs are either integer O or integer 1.
For each 4 integers that are input, the FSM needs to see whether they match one of two given sequences: 1010, or 0110.
The FSM outputs are 1 (integer) if either one of the two sequences was found. Otherwise, the FSM outputs a 0 (integer).
Overlapping sequences are accepted, e. g., 1 0 1 0 1 0 will produce the output 0 0 0 1 0 1. The integers are input one at a time, so we can't see all 4 integers at once.