Question: 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

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 (S0and T0), determine the shortest input sequence that will distinguish the two machines.

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

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

Step by Step Solution

3.38 Rating (170 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

Input 0 0 0 1 1 ... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Digital Systems Design Questions!