Solution

ID: past-exam-of-the-year-1-of-the-computer-science-course-of-the-university-of-oxford/2018/digital-systems-linear-algebra-introduction-to-formal-proof/2/b/solution

The steady-state output is . Its Karnaugh map, with rows and columns in Gray code order, is
The existing prime implicants cover adjacent ones except for some transitions in . The consensus theorem supplies the two missing bridging implicants and , giving
Both are needed in a hazard-free sum of products retaining the original terms. At , the two values of require a common implicant, necessarily covered by ; at , the corresponding transition requires . Neither bridge covers the other's critical edge. All other adjacent-one pairs already share a term. Thus two is the least number of additional prime implicants. This addresses single-input static hazards; simultaneous input changes require separate analysis.

New to topics? Read the docs here!