Seqeuntial circuits, analysis, truth tables and state diags
This solution shows how to work from a given circuit implementation (a J-K flip flop circuit design) to derive the Boolean Logic and in so doing so simplify such logic using Boolean Algebra rules. The solution then goes on to show how such next state logic can be applied to K maps (that describe the next states) and derives next state truth tables. Finally the solution shows how, from the next state truth table, the state diagram can be derived.