ECE620_hw3sol

# ECE620_hw3sol - ECE 620 Dr R ROOSTA H.W 3 SOLUTIONS P1 This...

This preview shows pages 1–3. Sign up to view the full content.

ECE 620 Dr. R. ROOSTA H.W # 3 SOLUTIONS P1) This can be done by trial and error. By specifying both the entries as '0', let's see if we come up with a distinguishing sequence: Test for distinguishing sequence: Initial state Output sequence Final state 010 A -------------> 101 ----------------> A 010 B -------------> 001 -----------------> A 010 C ------------->100 ------------------> B 010 D ------------> 010 ------------------> C Since, all the output sequences are different for different initial states, "010" is the distinguishing sequence. Therefore, the complete state table is : x = 0 x = 1 A C, 1 D, 0 B C, 0 B, 1 C A, 1 C, 0 D B. 0 D, 0 P2) For table A: (converges) (converges) Since, one node appears in a group more than once, the tree gets terminated.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Therefore, there is no distinguishing sequence for the above table. For table B: Therefore, this machine has two distinguishing sequences of length 3: 111 and 110. and two distinguishing sequences of length 4:
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 6

ECE620_hw3sol - ECE 620 Dr R ROOSTA H.W 3 SOLUTIONS P1 This...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online