A sequential circuit has a single-bit input, A, and a single bot output Z. Z=1 each time the sequence 010 occurs, but otherwise Z=0. Assume a Mealy-Type Finite State Machinea. (10 Pts) Construct a State Transition Diagram. Show input, output, and transition conditions appropriately not a quiz it is a homework, don't reject it

Design a finite state machine (FSM) with one input A and two outputs S and L. The FSM should detect whether a short or a long pulse appears on input A and assert output S in case of a short pulse and assert output L in case of a long pulse. A short pulse is defined as a pulse that lasts up to a single state duration and a long pulse is defined as a pulse that lasts for more than one state transition. Draw the algorithmic state machine (ASM) chart of your FSM design.

A sequential circuit has one input X and four outputs Z₁ Z₂ Z3 Z4. Z1 Z2 Z3 Z4 represents the gray code encoded number equal to the number of pairs of adjacent 1's that have been received as inputs. Use the gray code that is on page 22 of the textbook. For example, if the circuit had received 7 pairs of 1's as inputs, Z₁ Z2 Z3 Z4 = 1011. In addition, the circuit resets when the circuit receives 5 pairs of 1's. Find a Moore state graph and table for the circuit. Examples Input sequence: Output sequences: X = 1 0 1 1 1 0 0 1 1 0 1 1 0 1 0 1 1 10 Z₁ = 0 0 0 0 0 0000000000100 Z₂ 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 0 0 Z3 0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 0 0 - Z4 = 0 0 0 1 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 X 11111111 Input sequence: Output sequences: Z₁ = 0 0 0 0 0 100 Z2 0 0 0 0 1 100 = Z3 = 0 0 1 1 1 1 0 0 Z4 0 1 1 0 0 0 0 1 =

1- In the following sequential circuit. There are 2 D FF (A and B), 2 inputs (x and y), and 1 output z The output and next-states equations are given A(t+1) = x'y + xA B(t+1) = x'B + xA z=B b- List the state table for the sequential circuit.