initial commit / add all books

9 files changed, 124 insertions, 0 deletions

diff --git a/48/CH12/EX12.10/eg_12_10.sce b/48/CH12/EX12.10/eg_12_10.sce
new file mode 100755
index 000000000..96e782628
--- /dev/null
+++ b/48/CH12/EX12.10/eg_12_10.sce
@@ -0,0 +1,6 @@
+clc;
+clear;
+disp("Partition pi of the machine M5 is {(AB),(CD),(EF)}");
+disp("If M5 posses a closed partition pi such that pi>λi .if the autonomous clock has #pi states the period p will be less than or equal to #pi ");
+disp("since in the above closed partition of M5 we have 3 states i.e. (AB) as one state and (CD) and (EF) as other two");
+disp("So the periodof the autonomous clock is p=3")
\ No newline at end of file
diff --git a/48/CH12/EX12.11/eg_12_11.sce b/48/CH12/EX12.11/eg_12_11.sce
new file mode 100755
index 000000000..200e07ef6
--- /dev/null
+++ b/48/CH12/EX12.11/eg_12_11.sce
@@ -0,0 +1,7 @@
+clc;

+clear

+disp("From the definition of partition pair(T,T^)which is an ordered pair of partitions such that if Si and Sj are in the same block of t, then for every input Ik in I, next states are in the same block of T^ ");

+disp("By applying the above definition we can obtain the following partition pairs");

+disp("(pi1,pi1^)=({(ABC),(DEF)},{(ABC),(DEF)})");

+disp("(t1,t1^)=({(ABCD),(EF)},{(AE),(BCDF)})");

+disp("(t2,t2^)=({(AE),(BCDF)},{(ACDE),(BF)})");
\ No newline at end of file
diff --git a/48/CH12/EX12.12/eg_12_12.sce b/48/CH12/EX12.12/eg_12_12.sce
new file mode 100755
index 000000000..f2082d374
--- /dev/null
+++ b/48/CH12/EX12.12/eg_12_12.sce
@@ -0,0 +1,21 @@
+clc;

+clear;

+//1 is equivalent to A ad 2 to B and so on.

+p1=['A' 'D']; //pairs in partition t(1 and 4 represents that 1st and 4th state are in the same block);

+p2=['C' 'E'];

+

+q1=['A' 'E'];  //pairs in partition t^

+q2=['B' 'D'];

+q3=['C' 'F'];

+

+disp("the following are the partitions of the machine M8");

+disp("T");

+disp('F',p2(2),p2(1),'B',p1);

+disp("T^");

+disp(q3,q2,q1);

+disp("------");

+disp("T");

+disp('F',p2,'B',p1);

+disp("T^");

+disp(q3,[q1 q2]);

+disp("------");
\ No newline at end of file
diff --git a/48/CH12/EX12.14/eg_12_14.sce b/48/CH12/EX12.14/eg_12_14.sce
new file mode 100755
index 000000000..2b2bcac77
--- /dev/null
+++ b/48/CH12/EX12.14/eg_12_14.sce
@@ -0,0 +1,26 @@
+clc;

+clear;

+//assume the first cloumn values are of machine M1 and 2nd column are of M2

+p=[1,1;1 3;2 2;2 4;3 3;3 1;4 4;4 2];

+z=1;

+for i=1:length(p(:,1))

+    for j=i:length(p(:,1))

+        if(p(i,1)==p(j,1) & i~=j)

+            q(z,:)=[p(i,:) p(j,:)];

+            z=z+1;

+        end

+    end

+end

+disp("pi(R)");

+disp(q);

+z=1;

+for i=1:length(p(:,1))

+    for j=i:length(p(:,1))

+        if(p(i,2)==p(j,2) & i~=j)

+            q(z,:)=[p(i,:) p(j,:)];

+            z=z+1;

+        end

+    end

+end

+disp("pi(S)");

+disp(q);
\ No newline at end of file
diff --git a/48/CH12/EX12.4/eg_12_4.sce b/48/CH12/EX12.4/eg_12_4.sce
new file mode 100755
index 000000000..5cc873342
--- /dev/null
+++ b/48/CH12/EX12.4/eg_12_4.sce
@@ -0,0 +1,23 @@
+clc;

+clear;

+disp("we know that a partition pi on the set of states of a Sequential machine M is said to be closed if,for every two states Si and Sj which are in the same block of pi and any Ith input successor of Si and Sj are also in the same group");

+disp("Based on the above definition we can make seven closed partitions as below");

+disp("**Parition 1**");

+disp("{A,B,C,D,E,F,G,H}")

+disp("**Parition 1**");

+disp("{(ABCD)(EFGH)}");

+disp("**Parition 2**");

+disp("{(ADEH)(BCFG)}")

+disp("**Parition 3**");

+disp("{(AD)(BCFG)(EH)}");

+disp("**Parition 4**");

+disp("{(ADEH)(BC)(FG)}")

+disp("**Parition 5**");

+disp("{(AD)(BC)(EH)(FG)}")

+disp("**Parition 6**");

+disp("{(ABCCDEFGH)}");

+disp("By assigning values from 000 to 111 to all the states from A to H and obtaining the functions for Y1,Y2,Y3 and z will result in this equations");

+disp("Y1=x^y1^");

+disp("Y2=x^y2+xy2^");

+disp("Y3=xy2+x^y1^y2y3^+y3^y2^y3+y1y2y3+x^y1y2^y3^");

+disp("z=y1^y2^y3");
\ No newline at end of file
diff --git a/48/CH12/EX12.5/eg_12_5.sce b/48/CH12/EX12.5/eg_12_5.sce
new file mode 100755
index 000000000..d137fbed7
--- /dev/null
+++ b/48/CH12/EX12.5/eg_12_5.sce
@@ -0,0 +1,14 @@
+clc;
+clear;
+disp("For the 4 state machine M4 in PG 397");
+disp("IF the four states A,B,C,D are assigned as 00,01,10,11(ta={(AC)(BD)})  and 00,01,11,10(tb={(AD)(BC)})");
+disp("And if the output,next state functions of both the assignments are calculated we can find that ");
+disp("For first assignment ");
+disp("Y1=x^y1+xy1^");
+disp("Y2=x^y2^+y1^y2^+xy1y2");
+disp("z=x^y1^y2^+x^y1y2+xy1^y2+xy1y2^");
+disp("Second Assignment ");
+disp("Y1=x^y1+x^y1");
+disp("Y2=x^y2^+xy1^y2+y1y2^");
+disp("z=x^y2^+xy2");
+disp("Since the second assignment results in reduced output expression this partition is called as output-consistent partition")
\ No newline at end of file
diff --git a/48/CH12/EX12.7/eg_12_7.sce b/48/CH12/EX12.7/eg_12_7.sce
new file mode 100755
index 000000000..a1fc60df4
--- /dev/null
+++ b/48/CH12/EX12.7/eg_12_7.sce
@@ -0,0 +1,7 @@
+clc;
+clear;
+disp("A partition pi0 on the states of a machine M is said to be output consistent if for every block pi0 and every input,all the states contained in the block have the same outputs");
+disp("Considering the above definition It can be understood that");
+disp("pi0={(AD),(BC)} is an output consistent partition of machine M4");
+disp("since the outputs of A,D states for any inputs are same and similarly the outputs of B,C are same.");
+disp("So the partition {(AD),(BC)} are said to be output consistent");
\ No newline at end of file
diff --git a/48/CH12/EX12.8/eg_12_8.sce b/48/CH12/EX12.8/eg_12_8.sce
new file mode 100755
index 000000000..9ac7518d2
--- /dev/null
+++ b/48/CH12/EX12.8/eg_12_8.sce
@@ -0,0 +1,9 @@
+clc;
+clear;
+disp("For the Machine M5 in PG 400");
+disp("State A implies the identification of states C and D");
+disp("similarly C implies the identification of E and F states");
+disp("In the same way C implies the identification of A and B");
+disp("Thus the smallest input consistent partition for M5 is ");
+disp("pi={(AB),(CD),(EF)}");
+disp("Any other partition that contains pi is also input consistent")
\ No newline at end of file
diff --git a/48/CH12/EX12.9/eg_12_9.sce b/48/CH12/EX12.9/eg_12_9.sce
new file mode 100755
index 000000000..91a7fdc31
--- /dev/null
+++ b/48/CH12/EX12.9/eg_12_9.sce
@@ -0,0 +1,11 @@
+clc;
+clear;
+disp("In previosuly problems we have determined the input and output consistent partitions for the Machine M5");
+disp("Input consistent partition {(AB),(CD),(EF)}");
+disp("Output consistent partition {(ACE),(BDF)}");
+disp("By assigning 000 to 101 to all the states from A to F");
+disp("we can find the expressions for the next state and the output");
+disp("Y1=y2");
+disp("Y2=y1^y2^");
+disp("Y3=xy3+xy2+x^y2^y3^+y2y3");
+disp("z=xy3^");
\ No newline at end of file