State graphs for two sequential machines are given here. The first graph represents a correctly functioning machine, and the second represents the same machine with a malfunction. Assuming that the two machines can be reset to their starting states (S₀and T₀), determine the shortest input sequence that will distinguish the two machines.

Transcribed Image Text:

0/1 0/1 SI 1/0 0/1 0/1 S2 1/1 So S3 1/0 1/0 0/1 0/1 T| 0/1 T3 0/1 1/1 To T2 1/0 1/0 1/0 is