diff options
Diffstat (limited to '3860/CH9')
| -rw-r--r-- | 3860/CH9/EX9.1/Ex9_1.sce | 18 | ||||
| -rw-r--r-- | 3860/CH9/EX9.1/Ex9_1.txt | 26 | ||||
| -rw-r--r-- | 3860/CH9/EX9.10/Ex9_10.sce | 19 | ||||
| -rw-r--r-- | 3860/CH9/EX9.10/Ex9_10.txt | 26 | ||||
| -rw-r--r-- | 3860/CH9/EX9.11/Ex9_11.sce | 22 | ||||
| -rw-r--r-- | 3860/CH9/EX9.11/Ex9_11.txt | 32 | ||||
| -rw-r--r-- | 3860/CH9/EX9.12/Ex9_12.sce | 39 | ||||
| -rw-r--r-- | 3860/CH9/EX9.12/Ex9_12.txt | 74 | ||||
| -rw-r--r-- | 3860/CH9/EX9.2/Ex9_2.sce | 22 | ||||
| -rw-r--r-- | 3860/CH9/EX9.2/Ex9_2.txt | 34 | ||||
| -rw-r--r-- | 3860/CH9/EX9.3/Ex9_3.sce | 23 | ||||
| -rw-r--r-- | 3860/CH9/EX9.3/Ex9_3.txt | 34 | ||||
| -rw-r--r-- | 3860/CH9/EX9.4/Ex9_4.sce | 21 | ||||
| -rw-r--r-- | 3860/CH9/EX9.4/Ex9_4.txt | 32 | ||||
| -rw-r--r-- | 3860/CH9/EX9.5/Ex9_5.sce | 19 | ||||
| -rw-r--r-- | 3860/CH9/EX9.5/Ex9_5.txt | 32 | ||||
| -rw-r--r-- | 3860/CH9/EX9.6/Ex9_6.sce | 22 | ||||
| -rw-r--r-- | 3860/CH9/EX9.6/Ex9_6.txt | 30 | ||||
| -rw-r--r-- | 3860/CH9/EX9.7/Ex9_7.sce | 16 | ||||
| -rw-r--r-- | 3860/CH9/EX9.7/Ex9_7.txt | 26 | ||||
| -rw-r--r-- | 3860/CH9/EX9.8/Ex9_8.sce | 20 | ||||
| -rw-r--r-- | 3860/CH9/EX9.8/Ex9_8.txt | 36 | ||||
| -rw-r--r-- | 3860/CH9/EX9.9/Ex9_9.sce | 22 | ||||
| -rw-r--r-- | 3860/CH9/EX9.9/Ex9_9.txt | 40 |
24 files changed, 685 insertions, 0 deletions
diff --git a/3860/CH9/EX9.1/Ex9_1.sce b/3860/CH9/EX9.1/Ex9_1.sce new file mode 100644 index 000000000..5dbcc15d3 --- /dev/null +++ b/3860/CH9/EX9.1/Ex9_1.sce @@ -0,0 +1,18 @@ +//Example 9.1: Reduction of state table
+clc // Clears the console
+disp("Given State Table")
+disp("q | x=0 x=1 | x=0 x=1")
+disp('-----------------------------------------')
+disp("A | C B | 0 0")
+disp("B | D D | 0 0")
+disp("C | A D | 0 1")
+disp("D | A C | 0 1")
+disp('State C and D are equivalent. So, reduced state table is as given below.')
+disp("q | x=0 x=1 | x=0 x=1")
+disp('----------------------------------------------')
+disp(" A | C-D B | 0 0")
+disp(" B | C-D C-D | 0 0")
+disp("C-D | A C-D | 0 1")
+//displays the reduced state table.
+
+
diff --git a/3860/CH9/EX9.1/Ex9_1.txt b/3860/CH9/EX9.1/Ex9_1.txt new file mode 100644 index 000000000..9483bb1e7 --- /dev/null +++ b/3860/CH9/EX9.1/Ex9_1.txt @@ -0,0 +1,26 @@ +
+ Given State Table
+
+ q | x=0 x=1 | x=0 x=1
+
+ -----------------------------------------
+
+ A | C B | 0 0
+
+ B | D D | 0 0
+
+ C | A D | 0 1
+
+ D | A C | 0 1
+
+ State C and D are equivalent. So, reduced state table is as given below.
+
+ q | x=0 x=1 | x=0 x=1
+
+ ----------------------------------------------
+
+ A | C-D B | 0 0
+
+ B | C-D C-D | 0 0
+
+ C-D | A C-D | 0 1
diff --git a/3860/CH9/EX9.10/Ex9_10.sce b/3860/CH9/EX9.10/Ex9_10.sce new file mode 100644 index 000000000..284969e52 --- /dev/null +++ b/3860/CH9/EX9.10/Ex9_10.sce @@ -0,0 +1,19 @@ +//Example 9.10: Reduction of state table
+clc // Clears the console
+disp("Given State Table")
+disp("q | x=0 x=1 | z")
+disp('--------------------------------')
+disp("A | C D | 0")
+disp("B | D A | 1")
+disp("C | E D | 0")
+disp("D | B A | 0")
+disp("E | C D | 0")
+disp('States A-C-E and B-D are equivalent')
+disp(" q | x=0 x=1 | z")
+disp('------------------------------------')
+disp(" A | A B | 0")
+disp(" B | B A | 1")
+
+//displays the reduced state table.
+
+
diff --git a/3860/CH9/EX9.10/Ex9_10.txt b/3860/CH9/EX9.10/Ex9_10.txt new file mode 100644 index 000000000..05eb8681e --- /dev/null +++ b/3860/CH9/EX9.10/Ex9_10.txt @@ -0,0 +1,26 @@ +
+ Given State Table
+
+ q | x=0 x=1 | z
+
+ --------------------------------
+
+ A | C D | 0
+
+ B | D A | 1
+
+ C | E D | 0
+
+ D | B A | 0
+
+ E | C D | 0
+
+ States A-C-E and B-D are equivalent
+
+ q | x=0 x=1 | z
+
+ ------------------------------------
+
+ A | A B | 0
+
+ B | B A | 1
\ No newline at end of file diff --git a/3860/CH9/EX9.11/Ex9_11.sce b/3860/CH9/EX9.11/Ex9_11.sce new file mode 100644 index 000000000..999421a1c --- /dev/null +++ b/3860/CH9/EX9.11/Ex9_11.sce @@ -0,0 +1,22 @@ +//Example 9.11: Reduction of state table
+clc // Clears the console
+disp("Given State Table")
+disp("q | x=0 x=1 | z")
+disp('--------------------------------')
+disp("A | B E | 0")
+disp("B | D A | 1")
+disp("C | G A | 0")
+disp("D | F G | 1")
+disp("E | B C | 0")
+disp("F | D G | 1")
+disp("G | D E | 1")
+disp('The SP partition is also ouput consistent. The smallest equivalent system is given below')
+disp(" q | x=0 x=1 | z")
+disp('------------------------------------')
+disp(" A | B A | 0")
+disp(" B | D A | 1")
+disp(" D | D B | 1")
+
+//displays the reduced state table.
+
+
diff --git a/3860/CH9/EX9.11/Ex9_11.txt b/3860/CH9/EX9.11/Ex9_11.txt new file mode 100644 index 000000000..66f5d3a2a --- /dev/null +++ b/3860/CH9/EX9.11/Ex9_11.txt @@ -0,0 +1,32 @@ +
+ Given State Table
+
+ q | x=0 x=1 | z
+
+ --------------------------------
+
+ A | B E | 0
+
+ B | D A | 1
+
+ C | G A | 0
+
+ D | F G | 1
+
+ E | B C | 0
+
+ F | D G | 1
+
+ G | D E | 1
+
+ The SP partition is also ouput consistent. The smallest equivalent system is given below
+
+ q | x=0 x=1 | z
+
+ ------------------------------------
+
+ A | B A | 0
+
+ B | D A | 1
+
+ D | D B | 1
\ No newline at end of file diff --git a/3860/CH9/EX9.12/Ex9_12.sce b/3860/CH9/EX9.12/Ex9_12.sce new file mode 100644 index 000000000..68783fcde --- /dev/null +++ b/3860/CH9/EX9.12/Ex9_12.sce @@ -0,0 +1,39 @@ +//Example 9.12: Reduction of state table
+clc // Clears the console
+disp("Given State Table")
+disp("q | x=0 x=1 | z1 z2 z3 z4 z5")
+disp('--------------------------------')
+disp("A | D B | 0 0 0 1 1")
+disp("B | E C | 0 0 1 0 1")
+disp("C | A B | 1 1 0 0 1")
+disp("D | E C | 1 1 1 1 1")
+disp("E | D B | 1 0 0 1 1")
+disp('Step 1 produces given SP Partitions')
+disp('P1 = (ADE)(BC)')
+disp('P2 = (AE)(B)(C)(D)')
+disp('P3 = (AE)(BC)(D)')
+disp('P4 = (A)(BD)(C)(E)')
+disp('P5 = (AE)(BCD)')
+disp('Step 2 requires three sums')
+disp('P2 + P4 = (AE)(BD)(C)--> P6')
+disp('There are six non trivial SP partitions.')
+disp('For the first output column, None of the SP partitions are output consistent')
+disp('for the second output column only P2 is output consistent')
+disp("q | x=0 x=1 | z2")
+disp('--------------------------------')
+disp("A | D B | 0")
+disp("B | A C | 0")
+disp("C | A B | 1")
+disp("D | A C | 1")
+disp('for the third output column only P2, P4 and P6 all are output consistent')
+disp("q | x=0 x=1 | z3")
+disp('--------------------------------')
+disp("A | B B | 0")
+disp("B | A C | 0")
+disp("C | A B | 1")
+disp('for the fourth output column only P1 is output consistent')
+disp("q | x=0 x=1 | z3")
+disp('--------------------------------')
+disp("A | A B | 0")
+disp("B | A B | 1")
+disp('for the last output column there is no need to find the SP partitions, The system is combinational. It does not depend on the state z=1')
diff --git a/3860/CH9/EX9.12/Ex9_12.txt b/3860/CH9/EX9.12/Ex9_12.txt new file mode 100644 index 000000000..c0e3e70d6 --- /dev/null +++ b/3860/CH9/EX9.12/Ex9_12.txt @@ -0,0 +1,74 @@ +
+ Given State Table
+
+ q | x=0 x=1 | z1 z2 z3 z4 z5
+
+ --------------------------------
+
+ A | D B | 0 0 0 1 1
+
+ B | E C | 0 0 1 0 1
+
+ C | A B | 1 1 0 0 1
+
+ D | E C | 1 1 1 1 1
+
+ E | D B | 1 0 0 1 1
+
+ Step 1 produces given SP Partitions
+
+ P1 = (ADE)(BC)
+
+ P2 = (AE)(B)(C)(D)
+
+ P3 = (AE)(BC)(D)
+
+ P4 = (A)(BD)(C)(E)
+
+ P5 = (AE)(BCD)
+
+ Step 2 requires three sums
+
+ P2 + P4 = (AE)(BD)(C)--> P6
+
+ There are six non trivial SP partitions.
+
+ For the first output column, None of the SP partitions are output consistent
+
+ for the second output column only P2 is output consistent
+
+ q | x=0 x=1 | z2
+
+ --------------------------------
+
+ A | D B | 0
+
+ B | A C | 0
+
+ C | A B | 1
+
+ D | A C | 1
+
+ for the third output column only P2, P4 and P6 all are output consistent
+
+ q | x=0 x=1 | z3
+
+ --------------------------------
+
+ A | B B | 0
+
+ B | A C | 0
+
+ C | A B | 1
+
+ for the fourth output column only P1 is output consistent
+
+ q | x=0 x=1 | z3
+
+ --------------------------------
+
+ A | A B | 0
+
+ B | A B | 1
+
+ for the last output column there is no need to find the SP partitions, The system is combinational. It does not depend on the state z=1
\ No newline at end of file diff --git a/3860/CH9/EX9.2/Ex9_2.sce b/3860/CH9/EX9.2/Ex9_2.sce new file mode 100644 index 000000000..4b843b981 --- /dev/null +++ b/3860/CH9/EX9.2/Ex9_2.sce @@ -0,0 +1,22 @@ +//Example 9.2: Reduction of state table
+clc // Clears the console
+disp("Given State Table")
+disp("q | x=0 x=1 | z")
+disp('--------------------------------')
+disp("A | B D | 1")
+disp("B | D F | 1")
+disp("C | D A | 0")
+disp("D | D E | 0")
+disp("E | B C | 1")
+disp("F | C D | 0")
+disp('States A-E imply C-D and State C-D imply A-E')
+disp('AE and CD are equivalent')
+disp(" q | x=0 x=1 | z")
+disp('------------------------------------')
+disp("A-E | B C-D | 1")
+disp(" B | C-D F | 1")
+disp("C-D | C-D A-E | 0")
+disp(" F | C-D C-D | 0")
+//displays the reduced state table.
+
+
diff --git a/3860/CH9/EX9.2/Ex9_2.txt b/3860/CH9/EX9.2/Ex9_2.txt new file mode 100644 index 000000000..aaebea29a --- /dev/null +++ b/3860/CH9/EX9.2/Ex9_2.txt @@ -0,0 +1,34 @@ +
+ Given State Table
+
+ q | x=0 x=1 | z
+
+ --------------------------------
+
+ A | B D | 1
+
+ B | D F | 1
+
+ C | D A | 0
+
+ D | D E | 0
+
+ E | B C | 1
+
+ F | C D | 0
+
+ States A-E imply C-D and State C-D imply A-E
+
+ AE and CD are equivalent
+
+ q | x=0 x=1 | z
+
+ ------------------------------------
+
+ A-E | B C-D | 1
+
+ B | C-D F | 1
+
+ C-D | C-D A-E | 0
+
+ F | C-D C-D | 0
diff --git a/3860/CH9/EX9.3/Ex9_3.sce b/3860/CH9/EX9.3/Ex9_3.sce new file mode 100644 index 000000000..69b212476 --- /dev/null +++ b/3860/CH9/EX9.3/Ex9_3.sce @@ -0,0 +1,23 @@ +//Example 9.3: Reduction of state table
+clc // Clears the console
+disp("Given State Table")
+disp("q | x=0 x=1 | z")
+disp('--------------------------------')
+disp("A | C D | 1")
+disp("B | C D | 0")
+disp("C | B D | 1")
+disp("D | C A | 1")
+disp('step 1 produces five SP Partitions')
+disp('P1 = (AB)(C)(D)')
+disp('P1 = (ABC)(D)')
+disp('P1 = (AD)(B)(C)')
+disp('P1 = (A)(BC)(D)')
+disp('P1 = (ABD)(C)')
+
+disp('P1 = (AB)(C)(D)')
+disp('P1 = (AB)(C)(D)')
+disp('The chart is different, because the pairings that are automatically X''d are different.')
+disp('None of the conditions can be satisfied, and thus, no states can be combined and state table cannot be reduced.')
+
+
+
diff --git a/3860/CH9/EX9.3/Ex9_3.txt b/3860/CH9/EX9.3/Ex9_3.txt new file mode 100644 index 000000000..e4a26bd57 --- /dev/null +++ b/3860/CH9/EX9.3/Ex9_3.txt @@ -0,0 +1,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.
\ No newline at end of file diff --git a/3860/CH9/EX9.4/Ex9_4.sce b/3860/CH9/EX9.4/Ex9_4.sce new file mode 100644 index 000000000..c00f918e7 --- /dev/null +++ b/3860/CH9/EX9.4/Ex9_4.sce @@ -0,0 +1,21 @@ +//Example 9.4: Reduction of state table
+clc // Clears the console
+disp("Given State Table")
+disp("q | x=0 x=1 | x=0 x=1")
+disp('-----------------------------------------')
+disp("A | F B | 0 0")
+disp("B | E G | 0 0")
+disp("C | C G | 0 0")
+disp("D | A C | 1 1")
+disp("E | E D | 0 0")
+disp("F | A B | 0 0")
+disp("G | F C | 1 1")
+disp('State A-F, B-C-E, and D-G are equivalent. So, reduced state table is as given below.')
+disp("q | x=0 x=1 | x=0 x=1")
+disp('----------------------------------------------')
+disp(" A | A B | 0 0")
+disp(" B | B D | 0 0")
+disp(" D | A B | 1 1")
+//displays the reduced state table.
+
+
diff --git a/3860/CH9/EX9.4/Ex9_4.txt b/3860/CH9/EX9.4/Ex9_4.txt new file mode 100644 index 000000000..f2d0ed915 --- /dev/null +++ b/3860/CH9/EX9.4/Ex9_4.txt @@ -0,0 +1,32 @@ +
+ Given State Table
+
+ q | x=0 x=1 | x=0 x=1
+
+ -----------------------------------------
+
+ A | F B | 0 0
+
+ B | E G | 0 0
+
+ C | C G | 0 0
+
+ D | A C | 1 1
+
+ E | E D | 0 0
+
+ F | A B | 0 0
+
+ G | F C | 1 1
+
+ State A-F, B-C-E, and D-G are equivalent. So, reduced state table is as given below.
+
+ q | x=0 x=1 | x=0 x=1
+
+ ----------------------------------------------
+
+ A | A B | 0 0
+
+ B | B D | 0 0
+
+ D | A B | 1 1
\ No newline at end of file diff --git a/3860/CH9/EX9.5/Ex9_5.sce b/3860/CH9/EX9.5/Ex9_5.sce new file mode 100644 index 000000000..1e59f3501 --- /dev/null +++ b/3860/CH9/EX9.5/Ex9_5.sce @@ -0,0 +1,19 @@ +//Example 9.5: Reduction of state table
+clc // Clears the console
+disp("Given State Table")
+disp("q | x=0 x=1 | x=0 x=1")
+disp('-----------------------------------------')
+disp("A | B D | 0 0")
+disp("B | E D | 1 0")
+disp("C | B C | 0 0")
+disp("D | F A | 0 0")
+disp("E | A B | 1 1")
+disp("F | E C | 1 0")
+disp('The set of equivalent states are A(A-C-D), B(B-F) and E')
+disp('The reduced state table is given below')
+disp("q | x=0 x=1 | x=0 x=1")
+disp('-----------------------------------------')
+disp("A | B A | 0 0")
+disp("B | E A | 1 0")
+disp("E | A B | 1 1")
+//displays the reduced state table.
diff --git a/3860/CH9/EX9.5/Ex9_5.txt b/3860/CH9/EX9.5/Ex9_5.txt new file mode 100644 index 000000000..9944ec017 --- /dev/null +++ b/3860/CH9/EX9.5/Ex9_5.txt @@ -0,0 +1,32 @@ +
+ Given State Table
+
+ q | x=0 x=1 | x=0 x=1
+
+ -----------------------------------------
+
+ A | B D | 0 0
+
+ B | E D | 1 0
+
+ C | B C | 0 0
+
+ D | F A | 0 0
+
+ E | A B | 1 1
+
+ F | E C | 1 0
+
+ The set of equivalent states are A(A-C-D), B(B-F) and E
+
+ The reduced state table is given below
+
+ q | x=0 x=1 | x=0 x=1
+
+ -----------------------------------------
+
+ A | B A | 0 0
+
+ B | E A | 1 0
+
+ E | A B | 1 1
\ No newline at end of file diff --git a/3860/CH9/EX9.6/Ex9_6.sce b/3860/CH9/EX9.6/Ex9_6.sce new file mode 100644 index 000000000..e628b5f87 --- /dev/null +++ b/3860/CH9/EX9.6/Ex9_6.sce @@ -0,0 +1,22 @@ +//Example 9.6: Reduction of state table
+clc // Clears the console
+disp("Given State Table")
+disp("q | x=00 x=01 x=10 x=11 | z")
+disp('--|--------------------------------|-----')
+disp("A | B A F D | 1")
+disp("B | E A D C | 1")
+disp("C | A F D C | 0")
+disp("D | A A B C | 1")
+disp("E | B A C B | 1")
+disp("F | A F B C | 0")
+disp('States A-E , B-D and C-F are equivalent')
+
+disp("q | x=00 x=01 x=10 x=11 | z")
+disp('--|--------------------------------|-----')
+disp("A | B A C B | 1")
+disp("B | A A B C | 1")
+disp("C | A C B C | 0")
+//displays the reduced state table.
+
+
+
\ No newline at end of file diff --git a/3860/CH9/EX9.6/Ex9_6.txt b/3860/CH9/EX9.6/Ex9_6.txt new file mode 100644 index 000000000..5c19e8de7 --- /dev/null +++ b/3860/CH9/EX9.6/Ex9_6.txt @@ -0,0 +1,30 @@ +
+ Given State Table
+
+ q | x=00 x=01 x=10 x=11 | z
+
+ --|--------------------------------|-----
+
+ A | B A F D | 1
+
+ B | E A D C | 1
+
+ C | A F D C | 0
+
+ D | A A B C | 1
+
+ E | B A C B | 1
+
+ F | A F B C | 0
+
+ States A-E , B-D and C-F are equivalent
+
+ q | x=00 x=01 x=10 x=11 | z
+
+ --|--------------------------------|-----
+
+ A | B A C B | 1
+
+ B | A A B C | 1
+
+ C | A C B C | 0
\ No newline at end of file diff --git a/3860/CH9/EX9.7/Ex9_7.sce b/3860/CH9/EX9.7/Ex9_7.sce new file mode 100644 index 000000000..ff0164268 --- /dev/null +++ b/3860/CH9/EX9.7/Ex9_7.sce @@ -0,0 +1,16 @@ +//Example 9.7 Output Consistent Partition +clc; //clears the console window +clear; //clears the variable browser +disp("Different hardware requirements based on different state assignments on Page No. 9-12"); +disp("First assignment for A,B,C,D,E are 000,001,010,011,100"); +disp("z = q2 + q3"); +disp("D1 = xq1 + xq3"); +disp("D2 = x''q1''q2'' + xq1''q3''"); +disp("D3 = x''q2q3 + x''q1 + zq1''q3''"); +disp("First assignment for A,B,C,D,E are 000,001,011,111,110"); +disp("Second Assignment "); +disp("z = q3"); +disp("D1 = x"); +disp("D2 = x + q2'' "); +disp("D3 = x''q1 + x''q2'' + {q2''q3'' or q1''q3'' } + xq1''q2"); +disp("Since the second assignment results in reduced output expression this partition is called as output-consistent partition") diff --git a/3860/CH9/EX9.7/Ex9_7.txt b/3860/CH9/EX9.7/Ex9_7.txt new file mode 100644 index 000000000..abb5e7759 --- /dev/null +++ b/3860/CH9/EX9.7/Ex9_7.txt @@ -0,0 +1,26 @@ +
+ Different hardware requirements based on different state assignments on Page No. 9-12
+
+ First assignment for A,B,C,D,E are 000,001,010,011,100
+
+ z = q2 + q3
+
+ D1 = xq1 + xq3
+
+ D2 = x'q1'q2' + xq1'q3'
+
+ D3 = x'q2q3 + x'q1 + zq1'q3'
+
+ First assignment for A,B,C,D,E are 000,001,011,111,110
+
+ Second Assignment
+
+ z = q3
+
+ D1 = x
+
+ D2 = x + q2'
+
+ D3 = x'q1 + x'q2' + {q2'q3' or q1'q3' } + xq1'q2
+
+ Since the second assignment results in reduced output expression this partition is called as output-consistent partition
diff --git a/3860/CH9/EX9.8/Ex9_8.sce b/3860/CH9/EX9.8/Ex9_8.sce new file mode 100644 index 000000000..0f5dc525b --- /dev/null +++ b/3860/CH9/EX9.8/Ex9_8.sce @@ -0,0 +1,20 @@ +//Example 9.8: Reduction of state table
+clc // Clears the console
+disp("Given State Table")
+disp("q | x=0 x=1 | z")
+disp('--------------------------------')
+disp("A | C D | 1")
+disp("B | C D | 0")
+disp("C | B D | 1")
+disp("D | C A | 1")
+disp('Step 1 produces five SP Partitions')
+disp('P1 = (AB)(C)(D)')
+disp('P2 = (ABC)(D)')
+disp('P3 = (AD)(B)(C)')
+disp('P4 = (A)(BC)(D)')
+disp('P5 = (ABD)(C)')
+disp('Step 2 requires three sums')
+disp('P1 + P3 = (ABD)(C)--> P5')
+disp('P1 + P4 = (ABC)(D)--> P2')
+disp('P3 + P4 = (AD)(BC)--> P6')
+disp('only one new partition is found by step 2.')
diff --git a/3860/CH9/EX9.8/Ex9_8.txt b/3860/CH9/EX9.8/Ex9_8.txt new file mode 100644 index 000000000..4c124ab75 --- /dev/null +++ b/3860/CH9/EX9.8/Ex9_8.txt @@ -0,0 +1,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.
\ No newline at end of file diff --git a/3860/CH9/EX9.9/Ex9_9.sce b/3860/CH9/EX9.9/Ex9_9.sce new file mode 100644 index 000000000..66ae10ed9 --- /dev/null +++ b/3860/CH9/EX9.9/Ex9_9.sce @@ -0,0 +1,22 @@ +//Example 9.9: Reduction of state table
+clc // Clears the console
+disp("Given State Table")
+disp("q | x=0 x=1 | z")
+disp('--------------------------------')
+disp("A | C D | 0")
+disp("B | D A | 0")
+disp("C | E D | 0")
+disp("D | B A | 1")
+disp("E | C D | 1")
+disp('Step 1 produces five SP Partitions')
+disp('P1 = (ACE)(BD)')
+disp('P2 = (ADE)(BC)')
+disp('P3 = (AE)(B)(C)(D)')
+disp('P4 = (A)(BD)(C)(E)')
+disp('P5 = (A)(B)(CE)(D)')
+disp('Step 2 requires three sums')
+disp('P1 + P4 = (ACE)(BD)--> P6')
+disp('P3 + P4 = (AE)(BD)(C)--> P7')
+disp('P4 + P5 = (A)(CE)(BD)--> P8')
+disp('P7 + P8 = (ACE)(BD)--> P6')
+disp('There are eight non trivial SP partition, of which two are two block and none are output consistent.')
diff --git a/3860/CH9/EX9.9/Ex9_9.txt b/3860/CH9/EX9.9/Ex9_9.txt new file mode 100644 index 000000000..a052a3f12 --- /dev/null +++ b/3860/CH9/EX9.9/Ex9_9.txt @@ -0,0 +1,40 @@ +
+ Given State Table
+
+ q | x=0 x=1 | z
+
+ --------------------------------
+
+ A | C D | 0
+
+ B | D A | 0
+
+ C | E D | 0
+
+ D | B A | 1
+
+ E | C D | 1
+
+ Step 1 produces five SP Partitions
+
+ P1 = (ACE)(BD)
+
+ P2 = (ADE)(BC)
+
+ P3 = (AE)(B)(C)(D)
+
+ P4 = (A)(BD)(C)(E)
+
+ P5 = (A)(B)(CE)(D)
+
+ Step 2 requires three sums
+
+ P1 + P4 = (ACE)(BD)--> P6
+
+ P3 + P4 = (AE)(BD)(C)--> P7
+
+ P4 + P5 = (A)(CE)(BD)--> P8
+
+ P7 + P8 = (ACE)(BD)--> P6
+
+ There are eight non trivial SP partition, of which two are two block and none are output consistent
\ No newline at end of file |