Question

1. (a) Draw a state diagram and state table and show what if anything is wrong with the following synchronous state machine that has asynchronous input \(\mathrm{X}\) and state variables \(\mathrm{A} \& \mathrm{~B}\) ?

(b) If possible, draw a new circuit (without adding or removing any flip-flops) that has the same functionality but fixes any problem with the circuit. Also, show the new state diagram and state table.

Answer 1

(a) D_A = (A + B + X)^1 and D_B = (A + B + x) state table Q_A 0 0 1 1 Q_B 0 1 0 1 D_A 10 00 00 00 D_B 01 11 11 11 X 01 01 01 01 sate table indicate, The states in The case of a nondeterministic finite automaton a finite will move to based on The current state and other i/p fig: state diagram \r\n (b) D_A = A + B + X D_B = ABx + ABx + ABx + ABx + ABx D_B = ABx + AB + AB D_B = Ax + AB + AB D_B = Ax + (A + B) Then The CKT is fig: new CKT \r\n from The equation D_B = Ax + (A + B) + indicate The or date + rightarrow OR date rightarrow And gate state table Q_A 0 0 1 1 Q_B 0 1 0 1 D_A 10 00 00 00 D_B 01 11 11 11 X 01 01 01 01