Answer Happy

3. Synchronous State Graph (two-sequence detector with overlaps) [10%) Draw the state graph for a machine that to meet all of the following requirements. Has one input, X, and one output, Z. Z=1 during the (whole) clock cycle after the machine receives the complete sequence 01011. Z=1 during the (whole) clock cycle after the machine receives the complete sequence 001001. The leftmost bit of the sequences is received first. Overlapped sequences are to be detected (including a sequence overlapping itself). Z=0 except for the single clock period after the appropriate sequence is detected. The machine starts from the RESET state. Draw only the state graph (.e., no circuits). Complete the product state graph inside the solid-line rectangle below, and do not change anything already given. You may use the states provided on the sides for your procedure, but only the product state graph will be marked. Reset Za @ za Z zu . Z- za ODC @ @ X=1 Reset ze Reset Zs ze Z o
Reset Z. Reset 7. Z Z- 2- Z- © @ @ Z= Za tay 1 2 20 X=0 - X=0 ZE ( Za 20 2 ( 2