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 / 1 / e

Evaluate the implemented equations from part (d), rather than the don't-care entries of the original table:States $101$ and $110$ enter a valid state after one edge. State $111$ does so after one edge for zero, or moves to $110$ and enters a valid state on the following edge for either next input. Thus every unused state recovers within at most two clock edges, independently of the incoming bits. The machine cannot become trapped there. This self-starting finite-state machine property does not guarantee meaningful recognizer output during recovery; initialization to $S_0$ still establishes the intended stream history.