Consider the following DFA: M: (Q. E & q&F)-(ARC)&&(RCD) Find the equivalent regular expression for the following DFA by using state elimination method. Surt A

3. For the following truth table, C f 0 1 0 0 1 0 1 1 0 1 0 1 1 1 1 1 a ܘ ܘ ܘ 0 1 b 1100TOO TOTOTO 1) Show the sum of minterms in numerical form. 2) Show an algebraic expression in sum of minterms form and draw the logic diagram. 3) Simplify the sum of minterms form to a minimum SOP expression (three terms, six literals). Show each step of the simplification. Draw the logic diagram using the minimum SOP expression. 4) Show the product of maxterms in numerical form. 5) Show an algebraic expression for f in product of maxterm. 6) Simplify the product of maxterm form to a minimum POS expression for f (two terms, five literals). Show each step of the simplification.

Simplify the following Boolean functions, using three-variable K-maps: F = A’B’ + BC + A’BC’

Q1 Find the minimum sum-of-products expression for each function (d denotes don't care terms specified in parentheses). (a) f(a,b,c,d) = Σm(0,2,3,4,7,8,14) (b) f(a,b,c,d) = Σm(1,2,4,15) + Σd(0,3,14)