summaryrefslogtreecommitdiff
path: root/3860/CH9/EX9.8/Ex9_8.txt
blob: 4c124ab75824824e2057aab352d62bc814f88a73 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
 
 Given State Table

 q |    x=0         x=1   |    z

 --------------------------------

 A |     C           D    |    1

 B |     C           D    |    0

 C |     B           D    |    1

 D |     C           A    |    1

 Step 1 produces five SP Partitions

 P1 = (AB)(C)(D)

 P2 = (ABC)(D)

 P3 = (AD)(B)(C)

 P4 = (A)(BC)(D)

 P5 = (ABD)(C)

 Step 2 requires three sums

 P1 + P3 = (ABD)(C)--> P5

 P1 + P4 = (ABC)(D)--> P2

 P3 + P4 = (AD)(BC)--> P6

 only one new partition is found by step 2.