請教2題棘手的數位邏輯問題~謝謝~

lookto

各位高手
最近遇到2題蠻難的數位邏輯問題
希望能po上來尋求解題    謝謝!!
9 k; v8 R4 E7 i* z/ n8 Q- c9 D
1. You are given two identical sequential networks which realize the state table shown.  One network is initially in state “a” and the other network is initially in state “c”.  Specify an input sequence which could be used to distinguish between the two networks, and show the corresponding output sequence for each network for your “distinguishing sequence”.  Show that the sequence you found is the shortest distinguishing sequence (what is the length).   You must solve this in a procedural manner.  Trial and error guessing will not be accepted.  

7 Q1 i' o( \" }* pPresent
State           Next State for  x =
/ C6 L+ ^+ H# w; c5 h+ ]/ ], g, u                0            1
+ `4 X4 G0 i) ~ a             c , 0       f , 0
b             d , 0       e , 0  
c             h , 0       g , 0
d             b , 0       g , 0
/ ?1 I* f, ?, q& o; R6 a# v  t e             e , 0       b , 1
) F3 T* v" W' }% j) \/ ?: }; q f             f , 0       a , 1
g             c , 0       g , 1
4 D- F) [6 F9 p# M4 S3 m5 n h             c , 0       f , 0
# n+ v2 I# L& A+ J+ Y5 ?

2.This is a combinational problem.   You will need to investigate a technique known as Bridging.   This technique constructs the desired function F out of a chosen function F1.
! C5 E& M: _; Q' {0 CF = F1∙G1 + G2        where
G1  and G2 are chosen so as to “bridge” between F2 and F, and either G1 or G2 may also be Null.    (Hint:  this can be hard to find so you may want to look for material written by John Peatman.)
: B; v  Z& t& L, p2 O
6 o9 a& S/ o1 ^1 r% ]Use bridging to implement each of the 3 functions below.      
% A% L& X4 k. }3 N, r" F4 L
5 r% o1 r% h6 t) e) x! X  wFa(A,B,C,D)  =  ∑m(0,6, 9,10,15)
/ F2 v; ?8 r& C0 Q6 q2 n
Fb(A,B,C,D)  =  ∑m(0,1, 4,5,6,9,10,15)
" K0 U" o$ X! C* i- g% f! A
& \; H7 \! C8 T* g, r" ~Fc(A,B,C,D)  =  ∑m(1,3,4,5,6, 9,10,12,15)

0 c- L# K5 G$ X+ ]! W& d' r+ [% b真的很難!   謝謝!!