summaryrefslogtreecommitdiff
path: root/3860/CH9/EX9.3/Ex9_3.txt
blob: e4a26bd57280bc8241f7bf73aeb1177c089f7b89 (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
 
 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)

 P1 = (ABC)(D)

 P1 = (AD)(B)(C)

 P1 = (A)(BC)(D)

 P1 = (ABD)(C)

 P1 = (AB)(C)(D)

 P1 = (AB)(C)(D)

 The chart is different, because the pairings that are automatically X'd are different.

 None of the conditions can be satisfied, and thus, no states can be combined and state table cannot  be reduced.