Consider the following state transition diagram 1/0 Wählen Sie eine Antwort 000001 None of these is correct 100001 101001 000010 0/1 00 10 0/1 0/1 1/0 0/1 1/0 01 1/0 11 Let the state, indicated by 00 be the starting state. Now assume an input sequence of (int), in(t+1)) (0, 1, 0, 0, 1, 1). Which output sequence (out(t), out(t+1)) is the answer to this input sequence?

Give a regular expression for the set recognized by the finite-state machine and draw the finite-state machine.

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 =

B- Fill out the following tables for JK FF. Consider that Q(t) and Q(t+1) are the current state and next state respectively. J 0 0 1 1 1 KQ(t+1) 0 1 0 1