Hardware Reference
In-Depth Information
D
Del
A
a 1 xc
d 0 cx
a 1 xc
d 0 cx
a 1 xc
d 0 cx
a 1 xc
d 0 cx
D
Del
A
d 0 cx
a 0 xc
Acc
Acc
d 1 cx
a 1 xc
A
Del
D
d 1 cx
a 0 xc
d 1 cx
a 0 xc
d 1 cx
a 0 xc
d 1 cx
a 0 xc
A
Del
D
Fig. 2.9 Composition PS ˘ PC ˘ PR \ S *f Acc;Del g of communication system PS ˘ PC ˘ PR
and largest converter S of the converter problem of Sect. 2.3.2
and S C D Q C Df s1; s2; s3; s4 g , ˙ C D I O, C Df .i1 o0; s1; s2/,
.i 0 o0; s1; s3/, .i 0 o1; s 2 ; s1/, .i1 01; s2; s3/ g , .i 0 o1; s 3; s1/, .i1 o1; s 3; s 4/,
.i1 o1; s 4 ; s 3/ g , .i 0 o0; s4; s3/, r C D s1.
Compute the largest solution of the equation A X
C ,whereX has inputs
I
V .
Verify whether in this example the largest solution is complete with respect to I .
2.3. Consider the alphabets I
Df i1; i2 g , V
Df v 1; v 2 g , O
Df o1; o2 g ,and
the automata A
Dh S A A ; A ;r A ;Q A i
and C
Dh S C C ; C ;r C ;Q C i .Let
the automata be defined as follows: S A
D
Q A
Df s1; s2 g , ˙ A
D
V
O, A
D
 
Search WWH ::




Custom Search