3. [40 points] The state table, shown below, is for a sequential circuit with one input x and one output z. Complete the state merger diagram for this circuit [20 points] and answer the following questions.
3
B
Current
Input
C
State
x=0
x = 0
AD
A
A, 1
E, 0
D
B
C, 0
A, 1
C
B, 0
C, 1
D
B, 0
C, 1
E
E
D, 0
F, 1
F
A, 1
B, 0
F
Next State, z
A
B CD
E
TRUE FALSE
TRUE FALSE
a. [4] States C and E are equivalent.
b. [4] States A and F are equivalent.
c. [4] State B is equivalent to:
A: State F
B: State C
C: State A
D: State D
E: None of the choices
d. [4] The minimum number of states is:
A: 3
B: 4
C: 5
D: 2
E: 6
e. [4] Using suitable labels for the equivalent states, complete the following minimal state table.
Current
State
Input
x = 0
x = 1
Next State, z
