5.2.1, Introduction | Tn the: mid of 1800's, British mathematician “George Boole” introduce: « mathematical Steucture called Booican algebra, De-morgan, Pierie and Jevens developed Boolean algebra with modifications. Boolean Algebra is basically two values, 1¢., (1, 0) tunction. Previously, it had its application to nts and sets which are either (rue or false, Now-a-days it has wide applications to switching Gircuits which are either on or off, (e., (open or closed). Basically, there are three operations in the case of Boolean algebra (i) And, (ii) Or and (ii) Not, which are symbolically written as A, V, (+). In sct thcory, these are wiitten us A, U and ', But in this chapter more common symbols (+), (:), (1) are used for the same operations respectively. Notation In Logics in a +, ’ i} se ae ‘ iat af ion of Boolean Algebra Any non-empty set B with two binary operations, ie, (‘+', for addition, ‘.? for multiplication) with i | | Word re ae 8 unary operation “ ’ ” and two distinct elements J and-41, is called Boolean Algebra |B, +, «, ‘] Provided the operations, satisfy the following axioms, 1. Commutative Idws. ra @atbabta, (i)a-b =b-a, Va,b EB. 2. Associative laws. ave, @at+@+ce@th)+e, (il) a: (bc) = (@-b)‘c, Va, b,c EB. 3. Ideutity elements. @at (i)a-1=1-a=0, Vaed, For addition ‘0’ is identity and for multiplivativu 1 is identity. _4Distributivelaws, —“Wa-+c)=abt+ac, ii) a + (b-c) = (@.+b)-(a +e), Va,b,c EB. Note: In Boolean Algebra, addition is distributive over the multiplication whereas in general algebra itis not so. 5. Complement, For each a € A, there exists a’ € B, such that @ata’=1, (i)a-a' = 0 Vacs, where 0nd 1 are additive and multiplicative identities, respectively. Illustrative Examples o / Searls 1. Let B = {0,1} be the given sct. The elements 0 and 1 being symbols having no relations with the numbers 0 and 1 used in arithmetic, Binary operations are‘ +" and‘ - * which are logicataddition rf Boolean. Algebra | 5.23 < \ caery 2 Scanned with CamScannerVaarsets Books \ e gnct mutnptecation, They to s. : » Jotowina tables (i) ard (i Then, the given sot B wth defined binary opera tables belong to 2. Hence, the Solution :1. Closure property; All the cntvie closed with respect 10 the given binary operatine 2, Commutative property + Since there is symmetry abuut the leading diagoma Therefore, commutativity wrt. theoperations* +. "and" both hull in OF Ne 1+0et and O:1= 1:0 = 0, etc S.Associative property : From the tables, we have (+Q4+10141 #1 and 1+ (+1) =1+1 =1 Gi) f both the tat From (i) and (ii), we conclude that (+0) +1 =1+ (041). Hence, associativity holds w. r. (the operation! +’ Similarly, 1-(0°1) =(4-0)-1 So, associativity also holds wr. t. snultpieaie operation ‘ F 4. Distributive property : Since, ‘ £ 1+ @-1) and (1+0)-(. +41) Hence, by (i) and (ii), we conclude that’ 14 (0-1) +0) +1). Therefore,‘ +*is distributive over *-'. Similarly; we can prove that, Hence, the distributive law holds. 5. Existence of additive and multiplicative identities, Sine 2, Weg from 0+0=0 i 1 3 Therefore, 0,1 € B are additive and mult ‘iteative files espsctively 6. Complementation property: From the given table @)0+1=1 ‘ fs os (ii) 0-1 = 0" Bee Fs Therefore, complements of 0nd 1 are 1 and 0 respectively. ° Thus, we find that all the axioms are Satisfied for the dolined opérations on B. Hence, {B, +, Boolean algebra. : arnple 2. Sate whether the se’ B = {a;b,¢, a) with the Meaaions defined in the given tables is a olean algebra? ° Scanned with CamScannerootean Algebra | 52% Solution : From table (j), we have at+a=ab+a=bcta=cd+a= Hence, a is true additive identity, also, from the Sth column of the table (ii), we have a-d=a,b-d=b,c-d=candd-d =d ‘Therefore, d is the multiplicative identity. 1. Commutativity property : Corresponding rows and columns from the tables being identical lead to the conclusion that the commutativity holds with respect to both the compositions defined on B. 2. Distributive property : From the tables, we have b+(C-d)=btc=d and (b+ c):(b +d) ~ deb =d. Hence, from the above two results we have bred =b4e):(b4d), Vic dED Similarly, we can show that - b(c+d)=betbed. 3. Associative property : It can easily be verified from the table that a+(b+e)=(@+b)te=d and @-(b-c) = (a'b)"¢ =a Va,b,c,d EB. Hence, associativity holds wr. t. both the operations. 4, Complementation property : Since, | OE dandb-c =a, hence ¢ is the complement of b, because d is tlie multiplicative identity and a is the additive identity. Similar results can be shown for all other elements of B. Heuve, every element of B has its complement in B. 5. Closure property : Every entry of the table belongs to B. Therefore, B is closed with respect to the above mentioned operations‘ + and‘, ae B be a set of positive mimbers being divisors of 30 und the operations V, on it are ed In the light of above discussions, we conclude that {B, +, -,' } is a Boolean algebra a bo = where cis L.CM. of a,b and @ b= d, where dis the H.CF-of a,b o Va,bc,d EB, then Bis a Boolean algebra, [R.G.PY., June 2003] Solution ; Let the set of division of 30)is B ={ 1,2,3,5,6, 10, 15, 30). ice, we have as per definitions of the given operations 3v5S=1SEB and 3A5S=1EB because 15 is L.C.M. of 3 and 5 and 1is their H.C. 1. Closure propert; Scanned with CamScanner1s tety Books Similarly, Hence, ” “®4® Show for all other clementso £8. eee and » the set is closed, rt the gina? SB, a tivity: Since, °M peratng =5v3 Similar, . ence, St€ tan be shown fr other Mfc % Hr Of Clements be} ast) 2 Vpn oclemeats belonging pp s i Cons, aAbe : Seat Cominutaivty hots « Ren eee Since, as finitions ae the given operations and + BV Sv Iie BR operations we han Hence, 85) v 10 = 15 v 1 n39, Similarly, we have 3¥ GV 19 = v5) vi0, ‘ 3A (SA 15) = Similar results can be A) = BA'5) as =1, ae obtained for all other elements of and av Vc)=@vbyve @A Ag) = i \ Therefore, associativity holds wy (1h ope NO) AG Vaid &. es Isw.r.t : : 4. Distributivity:: Since, both the given operations 3.V(5A10) =3.V5 =15 and V5) 4G v10) = 15 4 30=15, Hence, 3-V (SA10) = (3 v5) A (BY 10) ete. Therefore, we conclude that av (b Ac)=(@Vb) A (ave) and ah VC)=@Ab)V (a Nc), Va,b,cEB Therefore, the upes ativus obey the distributive law on each other. 5 Existence of identity elements : (i) Since, avi=lvaea,VacB (ii) a A30=30Aa=a,V aGB. be: Henice, Lis the identity for the operation ‘V’ and 30 is the identity for the oper Verification. Svi=ivs5=5 and 10.430 = 30 A10 = 10. Similarly, for ali other elements of B. Hence, the ides exist in 3. & Complementation : Since, we get a and b € B such that elements w.rt. both the given operation: (i) aVvb =30, (i)and Hence, the complement of a is b © B. Verification : Let a=5EB then 5v6=30 and 5A6=1 Hence, 6 is the complement of 5. A % Similarly, we can verify that all other elements of B have their complements in B. Hence, {B, V, A,'} is a Boolean algebra. Scanned with CamScannerbra yerties (Theorems) 0” Boolean Alge ra (8,40) vce woth tive ide is lie identity is unig Sf Multiplicative ' 5 i ypement a sae Ai) roreach € Bits OM? te ie rool. (i) Let 0 and 0) be two additive id i O40 = 3, Some Prop Boolean alge For am and” But, we have +0 =0+% > 0, =0 ‘Therefore, additive identity s unique im B Similarly, (@) may be proved: Gib and betwo complements ofa &B, then b+0 bac = +a) 040) (a+d)-@+0) =10+0 =bte e=ct0 ctad (+4)-(c +) (ateyb+e) 1b +0) bte ing, the above two results we find that, bee. Similarly, Compari ‘Therefore, the two complements of @ are equal. [R.GP.V» Dee 27 anton ye 2010) 2004, 055 Jum [ois additive identity) |» Oris additive identity) (hy commutativity) [:0is additive identity in 5] [2c is complement of a] (distributive law) (by commutativity) [i a’ =banda ta 4 (Lis multiplicative identity) [/: bis complement of a) [v ¢=a'anda+a'=1) ence, the complement of ais unique. So, every element of B has unique complement in it. ere aoa cree eos Proof. (i) a+ omiiiiey-1 =(@+a)-(a +a’) =ata;a' y/ =at0s =a, ata=a. Mi aazaat0 =aata-a’ =a:(ata') sal Hence, (ii) gpa” [e1isdentity wort") [ata’=1) (by distributive law) [ asa’ =0) (is identity w. r.t.¢+°) (@being additive identity) [saa =0) (by distributivity) treta’=1] Scanned with CamScanner—— a - , — [ . Lis multiplicative ‘dentin, jens aa=a,VaeEB, Micorem 3. Involution law : Vae8,(a')' =a Proof. Let a be any arbitrary element of B, then es 10)" =(a+a')-(a'y’ = a-(a’)' +a'-(a’y’ y) ‘ =a(a’y +0 (+ (@')'is complement of a’) =0+a(a’)’ rt = =a-a'+a-(a’y’ [- = aa’ +(a'y) (by Sistibucviyh =a@l [va +@y=y =a. (1 is multiplicative identity) Therefore, we have @)' =a, .@a+1=1VaE8B, (ii) a-0 =0, VaeB. Proof. Let a be any arbitrary element of 8, then @ a+1=1-@+1) [+ 1is multiplicative identity] = (@+a')-(a+1) ‘[-ate’=q =a+(a'-1) (by distributivity) sata’ (- a’-1=2) - =. : (eate=y Hence A, “ww 0+a-0 (by 0 being additive identity) a0 =a-a'+a-0 [= ee’ =0) = a-(a’ +0) (by distributivity) ~ aa! [ve +0=0) = 0. fe e-e'=q 2-0=0. be. 5. Absorption laws : : R.G.PY., Keb. 2008) @2+@b)=a, IRGP.y. em © ii) a-(@ +b)=2,Va,bCB. [R.G.PY,, June 2006; Jan-Feb, 2008; April 2010) Proof : Let a, b be two arbitrary elements of B then, ha er ob = arttap (by 1 being multiplicative identity) Pash +b) (by distributivity} 2 are) (by commutativity) mel [vb+1=4) =o, atab=a, VabeB, a (a+b) = (0+ 0)-(a-+b) [0s additive identity) =a + (0b) (by distributivity) Tat oa (by commutativity) at [)b-0=0, vez) Scanned with CamScannerRed ns Boolean Algehra | 5.29 Thennpyrs. (0° @atb=q Proot (i) (ithe a 4 1--0is additive identity) . i (ata =1 ‘ Deiat a x [e1is multiplicative identity) fe V=0, Doel Reorem 7. De-Morgan’s laws : em rgan’s laws ae Ey 1] be a Boolean algebra and. a, b be any two elements of et PY. June 2002; Dee. 2005; Feb, 2008; Jane 2009; April 2010} ae f (Gym a" by, Proof. (1) states that (a'-b') is the complementofaag. eee Therefore, we have to prove that Hs (2 +b) +a: = Land (a +5)-(a'-b") = where 1 is multiplicative and 0 is additive any ie I ee) ae) Now, (2+) +a! b' = (+b) +0'}-(a +d) +5) (by distributivity) [2+ @+e))-a+@ +d") (by associativity) [a 4 (a' + b)]-[a + (b +b") (by commutativity) [@ +a") +)-[a+ +") (by associativity) = (145)-(@+1) [vata'=1b+b'=1] =Pi=1 (vati=ib+1=3] ‘Therefore, Gb) tay = 1. ) Also, (a +b)-(a'-b (a'-b') + b-(a'b') (by distributivity) ‘ = (a-a')-b' + (b-b')-a" (by commutativity and associativity) Ob! + 0-0" [oa =0=5-0'] bi-0+a'-0 (by commutativity) 0+0 [a0 =0cte] [/:0is additive identity] @ ff Ne oi Consequently, - Hence, \de that (a'.b" By (1) and (2), we conclude that ot + BT is the ai) In this part, we have to prove that a Teton iy (By complem i the eumpleament uf (a ++) .¢ complement of (2°b). entation laws) ‘Therefore, we have to pe Aso 1 z (ab)-@' +) rapier sen) Wyss and iby + (a +b) = [a + +?) 1) +a! Now, («b) a fara) torte ve i i) (68 alae ro) s(t) ate) aon at) by comnutat (by commut Scanned with CamScanner=11 [ray =1 a Therefore, (a:b) +a +b") 21 and (@°d)-(a' 4b") = (a-b):0 4 (a-b)-b" = a-(h-a’) +a: (bh) = a (a'-b) + a-(b-b') = (@0')-b +a(bb') =0b+a0 [ =b0+a0 o+0 f= 9, Vag) 0. (0 being additive identity) Thus, (2.b).(a' + b') = 0. (2) By (1) and (2), we conclude that a’ + b' is the complement of a-b, consequently, (aby =a’ +8’. aan Illustrative Examples pimple 1. Let[B, +, -, "| bea Booleansalgebra anda, b & B, then show that : vH_.2+@+b)=045, iP (ab) =0-b, ab a:b! = 0, [RGPY,, April2009] (iv) ab satb=b, ©) a+b=b=a-b=a, i) ata’ Gil) a tab=a' sb.” IRGPI , April 2009) Solution : (i) a+ (atb)=(a+a)+h ‘a (by associativity) =atod. (oata=q) Hence, at@+b)=a45, (ii) @-(a-b) = (a-a)-b (by associativity) ob (by idempotent law) = @(a-b) ~ ab (iii) ab! = (a-b)b [> ab = a; given} = a-(b-b') (by associativity) =a0 [ev be =O, fy au=g Hence, ab=a > a:b’ =0, (iv) a+b=(a+b)-1 [+1 is muttiplicative identity) = (a+b) +b’) [vb+b'=1) = b4+a):( +b!) (by commutativity) =b+(a-b') (by distributivity) AAG (given that a-b" = 0) [/- Dis additive identity] — () a+b =b, given} (by distributivity) 4 5.30 | Variety Books ay » ey » Scanned with CamScanner=atan =a. Therefore, Babe nd i sbewb-a “ athe enya = (+b) +a') = a+ (ba'y - “24a! Hence, we have "at atad math, (vii) a tab = (a' + a)-(a' 4b) (a +a')-(u' +b) = 1a’ +b) sa'+b. a'+ab =a’ +b, Hepce, sere 2. Ina Boolean algebra (B, +, ,'], prove that : Hi) @ +0)" +b): +(atd'y =a’, (@’ +0) =a'-b+arc, Solution : (i) By De-Morgan’s law, (ab)! =a! +b’, we have (a+b) +(a+b') =[(a +b)-(a+ by) =(a+b-b')’ = (a +0) =(a)' =a. Hence, we get @) ‘Thus, we get (a+b) +(@+b')' =a’, Boolean Alvcbra | 5.31 (by idempotent tay, re,,a-a = a) (by absorption law,a + a-b = a) 1) 1 is multipticative identity] latan=y (by distributiviyy (by commutativity) Proved. (by disteibutivity) (by commutativity) [ata = [/:1 is multiplicative identity} Proved. [R-GPY., Dec. 2002] [R.G.P-V., Dec. 2002, 06] (by distributivity) [-b-b =) [veto Proved. LHS, = (@+)-(a" +c) = ur(u' +0) +b-(a’ 4 c) (by distributivity) = (aa tac) 4 (b-a' + bc) (by distributivity) = (0+ arc) + ba tbc = (ac +0) bea’ tbc = gic tba’ + bec = ac + ba’ + bel = ac +ba' + bc (ata') = ac + ba’ + be-a + bora’ ac + bera +a'b + a'be = fc (L+.b) + a'b (14 ¢)+ saclta'bl sacl a’, (or by(al tomate d. [sea =9) Proved. Scanned with CamScanner5.32 | Hartets Buoks Example 8. Simplifi the following : @ @ Wtbyan, fab tbc + bc, 4 < (ach + [a+ b')-b) (b) Shiow thar: Ob dC Haz (a+b). +0)-(r +4) (2+ d)a"b' =a +b)-(a'-b') = (a+b): (a+b)! =0. (ii) (a+ +0), Solution : (a) (i) (vabie ta +b’ +e’, a) [a | (a' b)} fa’ + (wb). [RG.PLY,, Deo, 2606) [by De Morgan's law, (a+ 6) = gy ] (a0 xy ) Thus, (2+ b)a'-b' =0, (ii) (a +h +0) ~ (a+b) 1 c]’ = (a+ bye (by De-Morgan's ay) = (a'-b')-c! (by De- -Morgan’s yy a'-b’ Hence, = al-bic! (ii) rat bot bec! (by commutativiy) (ate) tbc! (by distributiviy) (atetc') (by distributivity) =blat(c+c')) (by associativity) =b [a+ s [sete =b-1 (patisy =. [- Lis multiplicative identity Thus, ab+bectb-c'=b. (iv) abc 4a +b! te ab-ct(a-b:c)! (by De-Morgan’s law) } [vata'=y ) @b+ (a+b!) oY ab + [b-(a 45%)" (by commutativity) = ab+[b-a+b-b') (by distributivity) = a:b + [ab +uy [-a =ab and-bb' = 0) = ab + [ab]! -1 sata'=1) (i) [a+ (a'b')Nfa' + (a°b)) = [(a + 0'(a+ bya’ +0)-(a! +b)) os distributivity) =[L@+oyI1-(@’ +5) [va+a’=1) = (@+b')(0" +5) [- 1a =a] =a-a' tab tba +55 (by distributivity) [va-a’ =0) =O+a-d +b'a'+0 ab’ + ab. fa +b)-(b +0): (¢ +a) (a +b):[(b +0)-(c +.a)} (a+b):[(c +b) (c +a)} +b)(c+b-a) (by commutativity) (by associativity) (by commutativity) (by distributivity) (by distributiviy) sactb-cta:(b-a) +b-(b-a) ai. Scanned with CamScannerBoolean Algebra | $33 = @etbe + (a) -h + (-d)-u (by commutativity and associativity) CHb tad tba [yaa suete) c+ bc + (a:b + a:b) (by commutativity) [vata=a) =actbctad (by commutativity) btbctea HS SQL artar tata o1vaben i Solution : (i) LHS.b-0, 2(@) Leta = Oandb = 0,thena+b =0+0=0. Conversely. Ifa +b = 0, then a=at+0 sath =(a+b)-(a+b') =0(a+b') =0 b=b+0=bta-a'=(b+a)-(b +0) = (a + B)-(a’ +b) = 0-(a' +b) = 0. @, ab’=0 ° (ab’) = 0" . cd a+(b''=1 - “(Since a’ +b=1, 5 (iii) Let _ @th=a+canda-b =arc, then babtbu (by absorption law) =hb+ba= bb +a) ~ bat b) ~ b(ad ec) (givena +b =a +0) = bathe =ab+bc =actbe=(atb)c (given a-b =a) Ratcesacton (givena +b =a +4) Faeteoneteu =o(1+a) =¢, (oitaster=9 |. Algebra of Propositions this section, the truth values will be alloted tha eumehat-a 42 2+ Scanned with CamScanner. Application of Boolean Algebra in Switching Circuit ~~ Switching circuit and its applications. Switch is a device, which can control the flow of the current in electric circuits. The propertics of the Boolean algebra can be used in the logical designing of certain electrical network. Such networks involving switches is our subject at present. The switches can have precisely two mutually exclusive states, namely, ‘on’ and ‘off. In the ‘on’ state, switch is closed, consequently, the current flows whereas in ‘off state, the switch is open and the current does not flow. The two stages are shown in fig. 1 and fig. 2 respectively. Fig. The variable state of the switch is represented as given below . A————e x e—_____3 Fig. If the variable state of the switch is denoted by x, then x will have two mutually exclusive values 1 and 0. Thus, when x = 1, the switch is ‘on’ and the current flows whereas when x = 0, then swilch is off and the current does not flow. 5.3.6. Combination of Two Switches in a Circuit If_there be two switches, in the clectric network, they may be connected in two wa (1) Inseries, (2) In parallel. 1. Switches in series. Letx and y be the variable states of the two swilches conueeted in scrics, then the combined state of the (wo switches is represented by the compound form (x-y) or simply by xy. Diagrammatically, A 0 k 8 B ey or ey) a consequence of the above net-work, wve have the following table : Scanned with CamScannerKy | | v=o) 0 =5) ‘ative law) not‘ =") sfeertain can have rn ie is L wt his olf 5, then by xy. Application of Boolean Alba | 24 | re een E pees ‘ Saf ain the above table That the current does not low in the circum when any one of the ; . es # ei : 3 re Exercise 5.3 1, Find the Boolean functions corresponding to the following networks : Y \ 6 RS | ree a hyd @) Oe ) bE: SS as : —eae——eb @ /A—tea e——-e' B —e a e——* Scanned with CamScanner5.48 | Variety Books >, Sketch the folowing neworks and simplify them rte pero +2), ((c4y) +0 +2))2 Sane down the switch funet ified equivalent network tions for the tollowing figure and draw simP! ii ! i Answers 1, (kyr tayttxyztryt Gi)xy zt Eryx j Gi) & + ye weet 9) 4. (iv) (@-b + ave +a" -b):c'-(a' +b + 0) (ad tab! +a"-b" ir 2 : peti el F ' 7] xe eee ey i ate 0 hb Lye mn | xy2t*d Jd Simplified form 2 ‘aut gis : Sue ey x Simplified form that 2) og be erpe bY Aare ae) eee DAs Fez: BG ES 5 eS wipes b Simplified form } _) ohaomeK7r ae 3 A \eZ = wey] eS ezen lun i \ YUU drat iy! \ ed) fe 24 2G ®) wy ee seae ya rust eee Ss pe Chae i O mraz yer ye : ed Sie Sd meray yty2 i ; é ; 8 Ly. or : = s aya? a d 2 pce xcey) ty? Scanned with CamScannererr, Unit - \ Chapter - 4 Boolean Functions $4. Fsroduaiog as chapter we shall come across the words constant, variable, Boolean function and its forms. Therefore it willbe better to define some preliminaries reparatorysto the topic concerned ean onstant : Any symbol, to denote some definite element of Boole, algebra, is called a constant of Boolean algebra. 0 and 1 are two constants in Boolean algebra, ean arlale : Symbols used to denote any arbitrary clement of [B, +, +] are called variable of the Boolean algebra 05,6, ms.¥s2 nn 16 are used for varables of a Bed ica, algebra 2 Expression An expression built up from the varablesj,2, sy JZ. With the use of Boolean operations « a finite number of times is said to be a Boolean expression, Thus (i) all variables are Boolean expressions, and : (©) ifxandy are Boolean expressions then so ae (r+ )),x-y and! Ie cam define @ Boolean fanetioncorresponling to cach Boolean expression, Let Ly oop) be Foolean expression having its variables among (23, ...2), then Pte cy 1%) will denote a Boolean matian. In order to make the corresponding function unique, the varablen 1 are always listed in the order in which they occur in the list. My +x determines ie function f,9) 1 x’ then 0,0) =0+1'=0+0=Oand(0,1)=140'=141~ 4 ‘Two Boolean expressions are called equivalent (or equal) ifone can be obtained from the other by a Anite numberof applications of the ideutites uf a Boalean algebra (A Boolean expression in variables. 4, nis called symmetric itinterchanging any two variables resullsin an equivalent expression, © $4.2, Boolean Functions dmbinalion of constants and variables with nit applications of the binary operations and the unary eperation ofthe given Booleas algebra are called Boolean function. For example, Ferry 0-2) tahyhe ete i In other words, Ket (2, +, 0,1) be a Boolean algebra. A function f: 8" B whichis associated with a Boolean expression inn variables is called a Boolean function, pete. We may write U for ‘+? and for" while writing a Boolean function in terms of sets Note2. The number of variables in any lunction isthe number of distinct letters Present in the function. a andi are taken to be one variable. Thus a + a" a function of one variable while a.b" wad nk are‘the functions of two variables. Boolian Functions | 5.49 oe % ¢ Scanned with CamScanner' * pee J from a given set of independent it an be formed from 3! pend oolean functions that can t a itivect of Boslean f 4. The totality of distinct B eat inci ‘2 c se damental variables is known as the set of fund i 7 Boolean Aariables. f A. Types of Boolean Functions be operation “et, 7 i called LA. Monomial : Any Boolean function which does not include the op 7 Monomial examples Ley", 2":y"2 Fe eis ic, sun of Polynomial : Boolean functions having ‘+' signs and ‘-' are called Poly i ménomial functions ts a polynomial, In other words, we can say f Polynomial = f (Monomials) ae, t cxamples Lex +, 2x + "2, 300+ y"*2) +! #y"'2')- Bs f Note. Terms of Boolean polynomials are separated by ‘+” sign. For example, the terms o! f function x-y +2':y-z arex-y andx' yz, a i 3, Minimal Boolean function : In case of n variables, (11, %2, 23, 4x) the product of all the n variable taken together where the ith letters is x or x', is called minimal Boolean function or polynomial of n variables. Minimal Boolean functions for two variables.x and pare x-y, x-y’,x'-y and.’ -y’ and for three variables ,.z minimal Boolean functions are examples Lx-y-2,2t-y-2', 3e-y!-2,4e'-y-2,x-y'-2', Se!-y-2', Gx! -y!-2, Tx"-y'-2" re are 2° minimal Boolean polynomials (functions) in n variables. 5,94. Normal Boolean Function 2 Boolean function of n variables function. For example, SET Hae involves all the n variables in it then it is called a normal Boolean la + b, 2a + b',3a tab are nogmal Boolean functions of two variables.a and b. 2¥%. Types of Normal Forms C Canonical form (Disjuncti fom) + A Boolean function f (24,3) c.o,.An) Of n variables, when expressed as a polynomial in the form of sum of products (union of intersections) in such a way that each term involved all the n-variables, then it is known as canonical form or the disjunctive normal form of the Biven Boolean function Examples Q) f&y)axytety + aig'+ xg 2) fO,y2) =xb yee taeye2! bayer 2, Complete canonical form : If all the minimal functions of the given ntimber of variables constitute the terms of the canonical form, then that function is called the complete canonical form of the Boolean function of the said number of variables. In general, the vomplete canonical form of a Boolean function in ; ialpes contains 2" terms. The value of the complete canonical form in n-variables isl. Dual canonical form (or conjunctive normal form) : If a Boolean function f (ty, x2, 0-4 Xa) is expressed in factored form and each factor is the sum of all the n-variables. Then that function is called dual canonical form or conjunctive normal form. Examples ° Q) fy) = +y'):@ +9") is adual canonical form of Boolean function of two variables. si Scanned with CamScannerBoolean Funcsions | 551 at 2 Jy2) BW ty + ay (e +y' +2) : 15.9 Conjunctive normal form as Sa ae form or dual canonical form af Boolean function of tree: variables Y distnes ee MMORICA oem: Ha dual eanoniea form of a function of n-variables coutains all the 7 distinct factors, then that func ais a complete dual cannniral form. For cxatuple, #9) Fy) (+ ))-Q° 491) ¢ ‘complete dual canonical form of function of two arin: : The Value of dul canonical form in two variable &. The complement of a Boolean function expressed in dual canonical form : The product of all factors of the complete dual canonical form which don appear in the dual canonical form of the piven function 's known its complement. For example, bet FEO Hyt ty bey ety 12) @’+y'+2) then POOF FET YE), I) ty't7), &. The complement of Boolean function expressed in disjunctive normal form + Suppose fis @ Boolean n function expressed in disjunctive normal form. Then complement fe of fis a Booleau function which is the sum of all those terms of cor ive normal form which are not present in the disjunctive normal form of ‘OmpremrentTunction fis denote ‘or example, Let Now the complete disjunctive normal form in two variables is aptr'y tay tay! Hence Sy =xy try’ } —Sortunetive normal form: — pp.d.4su ] Step 1. Simplify the given function§ so that it cont disteibution, absorption, a + a’ = 1, aa' = and a-a = a laws Step 2." AddO to this simplified function or in each factor ifthe faction i in factor form, Step3. Put this 0 equal to the'product of the missing variable and its complement Step 4. Apply distributive aw a+ b-c = (a +)-(a+ 0), Step $. It any variable is missing again in any factor then ropent the above seps. Take the help of idempotent laws a + a = w yncl aa Suto remove the repeated luctors Simplily and get the desired form iafunctive normal form: 5.) >! di Step 1. Simplify the given function to contain minimum number of terms. Step 2. Multiply each term by as many 1 as the wuber of missing variable, in that term Step3- Put for, in the term which doesnot contains, asx +2" = 1 and gna epacement should be done for each 1, Step4. Apply distributive taw x-(y +y') = x-y +2-y' ete, atid See that no term is repeated. If so apply idempotent law, the result willbe the required disjunctive normal form a IMlustrative Examples Example 1. Express the Boolean function, Sez) = [e+ y) @y'2)']" (a)Asa polynomial, (b) Inthe factored form, Solution : (a) L(ey.2)= [eet y')-(ey'-2)) tains minimum number of terms. In this method use = ~ Scanned with CamScannerfe ane bere es wey Heyyy [by De-Morgan’s tnx} =e yt (rr) Iby De-Morgan’s lawand (x’)’ = x} erty tuys ing two terms. st SARC rR raya ie ey ier-tyt a Saeed ira) aKcneaahe roy tayo ~ eaty tuys Bee tye [by is ibang Be Oty) wees a) by distributivity} SPOEM EF) LW tay +4) be ra! — Late) = OHO Hy) +2)-94.2) which jpg fonction in factored form, ple 2. Obtain the disjunctive normal form of the Boolean function fexylztx'2, Solution : Since the second term of the polynomial |f docs not contain y, hence multiply 1 =y+y" and simplify, we get faxyoztx ez Sxylztx'2(y ty’) Sxyortx ryt’ G-Vez)h(eleyrz) + (x':y"-2). ius the function f has been represented in canonical form. iple 3. Find out the disjunctive normal form of the polynomial ‘ L@yD=[EtY) +O FZ) +yz lution :f(,y,2)=[(e+y') + +z')'|' +yz = ety aye)! | eyz [by De-Morgan’s Subs Foto ality: ae l =[rty'(1t+z))' +yz = [ety ll tyz a fry tyz =x' Wy tyz =atytyz ‘ waxy l+lyz axy@tz')+(etx')yz axlyzex'yz! txyztaxtyz ay ax'yztx'yz trys, ' Example 4. Write down the disjunctive normal form in minimum possible variables of the following ceiy, (b)xy" tace tary, (uty tw) (uy tu)’, Scanned with CamScannerss * Solution: (a) a ae Boolean Functions | 553 FEO ty) tery nich is the required disunctive normal fem pot (ey ae ee hormal form in minimum posible nner of variables Vt erd try Y°E+2) tery ty!) try-(e+7) i Yobey la tery tery bey tieys x tacylez! q Pe read txyatayatay 7 txy7) (by commutativity] yz) + yz) + ((e-yez) + (eyez) + feylz! txry-z"} weybz bayer tx: cal txeyez! - , Seyateyln kryal ta which is the required disjunctive normal form. : (c) The given function is, (ut + w)-(Uy tu wy! (ue tv tw): {Ce v)' (uv)! (tvtw) {ul tv) (ut wp = (Ut tw): (ula daw! vow ty ow) (uty tw) tul-w tye utyiw') (uty tw): (uw! + vou vow!) weulw! tev tev ww! teu w! tv visu + vv'-w" wei! wl tev on tw =O+uy tueview tu yew! +0+0+04+u-vi wt0 [by associativity, commutativity and u-u" = 0 ete] uv tueviw! Lulevav! tay uevel tay Ww tuey wi tuevw is 1 yb a) ac! owt ba va break auevw tuys h evi! buy! bev {(e-v"-09) + (uv! wy} {uv we) + ev wt) ee Seyi w tp ueyt ew! pal ve! [vata-a] which ig the required disjunctive normal form in minimum variables, Example 5. White diwn the function { (x.y) xiven in conjunciive nomal forme ta its disjunctive normal forn, wheref,y) = ty) tye FY). u 0 Solution: (¢ +y'):@’ +y)'@’ +9) i a @&ty)@' ty) [using distributive law] i = @ +y')@ +0). [ey = which is disjunctive normal form of the given function. Scanned with CamScanner554 JgMriety Books ‘ ppl, Conver the function, LOM 2)" Coby) (ek et) + ike’) {nto disjunetivn normal form. Solution sf (%¥2)" (HY) HR + YY Hz) BOHR) ayaa! [by distributive tay) mat Ore ty) tat [by associative law) marty tee [by absorption law} . mld yd tay SPOT) AG HR) beet) lo yty'=y EY bay et yb ata ad atx! (by distributive and commutative law} Fey te yd zhx | chy! [ery tary ry SET bey bbaelyel tated patatel PE H) $e 2) ta! yo(e +r) tz xyty) +2 xO ty) [since first erm is missing z, hence 1 =z +7’ etc] SEE baeye taeyts! bat yat tyes! tary tatxy! ta'a'y + 2'x'y’ [by distributive law) Saye t eye! taye2!) bayl2 + (yl! tayhz') Fx yet yz! tx' yz’) exh y'2 . [by commutative and associ taeylz tary! tx yz bet ye2! bay’ Zi bxty’ exyzery Sxeyzdxylztaty2 bye! byte! xt which is she required disjunctive normal form of the given function. Sa Mample 7. Convert the function @ £0697) = (oy’ eae") bx! ‘into disjunctive normal form, f Solution : SL G592)= (cy tz)! +9" = xy’) @z’) $2" [by De-Morgan’s law] Sk + 9) b'+ey] +x" [by De-Morgan's lav] =f ty) be +2] $2" ax tyztx [by distributive law) Salted yz [by associative law] sai tyz ax L+lyz Oty) + & FX) yz extytxly tayz tx yz Lexy Lary tay yilet2) +x (22!) txryz bx yz axyzbxty2 txryztalyl2 trey tx yz aa pzbxtyn Vxtyezbaxtyh2! bay, Scanned with CamScannerBoolean Functions | 55 Example 8. Hite the conjunctive nonnal forn uf tej for of the Junction, ae a (ry tae)! ty law] Sry fey! ae)! law) wy (ez) +0 [by De-Mosyau's law] law] = ty) Ge te) HH [by De-Morgan’s law re SR ty ee) a te +e!) [by distributivity] =) = Qt) Fy) {Ce Hx) +2") {by commutativity and associativity) law] = Gt +): +2’) (oe ty =r] oa ~ ( +y #0) #2 +0) = Gity tee) ('+2'tyy") [e271 <02yy] Sty) Fez} fete) tyy') te) Qty +2) Qu! ty #2!) z+ y) GQ #2! +y') [by distributivity] sity tzy ty tz'y@' ty’ +2') nnjunctive normal form of the given function 9] which is the <_ AeBersile 9: Find othe conjunctive nana form of the fallow Junctions in three variables a,b and c . ‘a) @, 2 *s) (b) (@ + b)-(a' +b’), Solution : (a) fla, b,c)= a =at0 ‘ [ =atb-b' [: 6-b' = 0) = (a +b)-(a+b') i [by distributivity) (@+b+0)-(a +h’ +0) (a+b) tee!) (@rb') tec} 1 ath tc)-(atb+c') (a+b! +o) (uth! +0’) — [by distributivity] |) Which is conjunctive normal frm of a Boolean function of single variable a in three variables. (1) Let the given function be denoted by f(a, b, c), then | J (a,b,c) = (a +b):(a' +b") | = (@4b + O)(a' +b’ +0) -@Fb +c) (TH +e’) = (a+b +c)-(atb +c')-(a' +b’ +c)-(a'+b' +e’) "which is conjunctive normal form of the function. Example 10. Change he disjunctive normal form xy" | x'y+x'y into conjunctive ndrmal form Solution: x-y' +x'-y'tx' y= (eta')y tly yin) aytry =O tx) O' ty) sity) i= ty) Scanned with CamScanner5.36 | Variety Books | iple 11. Express the function, Sey2) = (ety) (HI) O +D into conjunctive normal form, Solution : MEH) = Fy) Hy) Gl A 2, eps ie tae)» Of + +O) =e tyeea): (rey teed te #2) 499) [since z is missing in the first two factors andy is missing in the third factor, hence 2:2" replaces 0 of the first two factors andy-y’ in the third factor} = {ety tay (ety tey) (ty t2@ ty +29) ee [ren tye + 2+y)) [hy distribotive law HOH tw tytr) Oty tty tz) tytD Ee Fy +2) »njunctive normal form of the given function. (When the number of variables used in the conjunctive normal form is minimum ) @& +y)-@& +y)}-@' +2) {by associative law] =(@+yy))-@' +2) [by distributive law} +0)-(’ +2) 3 i = +2-2')-@' +2) [- = +2) +2')-@' +2). is gk€ conjunctive normal form having two variables x andz only. imple 12. Convert the function SY) = yxy)! +2" which is the required co: Alternative methos FO Iz, whi into conjuction normal form. Solution : L(y) = (ey ty) Fx" ; HG! I yy tx = fell ix arty x =r +0 =a tyy" = ty) ty"). Example 13. Find out the disjunctive and conjunctive normal, th cS feye= Ete Hye Oat ema [e+ ty) Sle + i . = HOY YEH OY +e} Ee SO Aen 1 iby ae g ex(ty+z) 5 © iar ay, (+ nee [ @+a-b = a} [absorption law] ee ate = [by distributivity] ae (¥ @-@ +b) = a} [absorption law) ead Scanned with CamScannerBoolean Functions \ SST =P Oty) Gz) Oy) + @y ye +2) [by distributiv ‘ ryztarya' tay etary which is disjunctive normal form of the given function, Again, since we have F042) =x+0+0 a P@&yz)=xtyy ez {yy =0=2-2'] @ty) ty) tz (Qty) t22'}{ (ety!) #202’) [by distributivity} HG ty tz) Oty tz)-(ety' +2)-Gety' +z’) [by distributivity) which is conjunctive normal form of the given function. OfExaitiple 14. Wrie the folowing functions in coniunctive and disiunctive normal forme in heen warinhlor Scanned with CamScanner