Consider the following logical expressions where A + B denotes A logical OR B, AB denotes A logical AND B, and ¯ A denotes inverse of A. Derive at least one additive (to be added by logical OR operation) term (excluding obvious 0, 1, A ¯ A or similar) which will not affect the result of the expression. For example, adding (by means of logical OR) term B C D to AB C+ ¯AB D does not change the result, for instance AB C+ ¯AB D ≡ B C D+AB C+ ¯AB D. In this case B C D is such an additive term. (a) AB C + B C ¯ D (b) AB C + B C D. Note: B C 6= ¯ B ¯ C (c) AB D + ¯AC + ¯B C (d) AB C + B ¯ C (e) ¯AB C D + ¯ A ¯B D + ¯ A ¯C D + AB D
Hint: Use K- map to solve your answer
Solution:
Explanation:
I have explained each and every part with the help of images attached to it.
Consider the following logical expressions where A + B denotes A logical OR B, AB denotes...
Consider the following logical expressions where A + B denotes A logical OR B, AB denotes A logical AND B, and ¯ A denotes inverse of A. Derive at least one additive (to be added by logical OR operation) term (excluding obvious 0, 1, A ¯ A or similar) which will not affect the result of the expression. For example, adding (by means of logical OR) term B C D to AB C+ ¯AB D does not change the result,...
1. Construct a DFA for each of the following regular expressions: a) ab + c b) a*b + c c) ab*c*+ ac 2. Construct an NFA for the following regular expression: a) (a + b)*ab b) a*b* c) a*b* + c d) a* + b* e) a* + b* + ac*
Problem 1. For following boolean expression: (AB)+(AC)+(ABC) a) Derive the gate schematic b) Simplify the boolean expression using i) Boolean Algebra simplification ii) Karnaugh Map simplification
1. Generate five strings from each of these regular expressions A. b ( ab ) * B. b (a + b)* C. (aa + b) * b D. a ( a + b)(a + b)b E. ab ( ab)* ab 2. Finite state machines for each of the above regular expression
The expression Y=AB+BC+AC shows the _________ operation. a) EX-OR b) SOP c) POS d) NOR
Do not solve part C, i have it 2.9 Find the complement of the following expressions: (b) ac ab' a bc' (a)* x'y' +xy (d) (B C')(A C')(B' t C" (c) z z '(v' w +xy)
6. Implement the following Boolean expressions using logic gates:o i. L (AB+ AB) (A + B) ii. L ABC + ABC + ABČ rontiers of iii. L = (A+ B). BC iv. L (A+ C). (B D)
For each of the following regular expressions, use (11.2.3) to construct an NFA. a. (ab)* b. a*b* c. (a + b)* d. a* + b*
Obtain the simplest SOP and POS for the following logical expression using K-MAP. 8. F(A,B,C,D) = ABD + ABCD
. Which of the following expressions is in SOP form? 5 (a) AB +CD+E (b) ABC+D) (c) (A+B)C+D+E) (d) M'N'+PQ