FA-89102 / Digital logic simulation / Member archive

Unknown input bit treated as a missing transition · case 02

An 'x' input leaves the machine in a definite state instead of the unknown state.

Member previewVariant 2 · 3 implementations · 7 checks per implementation

Case contract

Input [table, start, stream]: table[state] = {'out': o, 'next': {bit: state}}; stream items are [bit, rst] with bit 0/1/'x'. Each cycle outputs the current state's output (or 'x' in the unknown state 'X'), then clocks: rst==1 -> start (synchronous), else unknown input or state 'X' -> 'X', else follow next[bit], staying put if that transition is absent. Return [outputs, final state].

Why this case matters

Cycle-based simulators must emit Moore outputs from the pre-edge state and model unknown propagation through state registers.

One recorded failure

Sample boundary fixture

This sample comes from the broken implementation of a controlled reproducer.

Boundary fixture	Actual	Expected	Outcome
unknown input poisons state	`[[0, 0, 0, 1, 0, 0, 0], "B"]`	`[[0, 0, "x", "x", "x", "x", 0], "B"]`	Failed

MEMBER ARCHIVE

The complete case is available to members.

This record includes three runnable implementations, regression fixtures, execution results, and source hashes.

Member access is invitation-based. Sign in with your invited account to inspect the sources.