Reduction of Boolean Expression to its Lowest From

Click For Summary
The discussion focuses on techniques for reducing Boolean expressions to their lowest form, particularly in the context of a student studying Processing and Logic Concepts. A key strategy mentioned is identifying similarities in terms to simplify the expression effectively. An example Boolean expression is analyzed, demonstrating step-by-step reduction using established laws. Participants clarify that reducing to the lowest form means reaching a point where no further simplifications can be applied. The conversation concludes with a consensus on the importance of recognizing patterns and similarities in terms for successful reduction.
George SA
Messages
3
Reaction score
0
Hey Guys

I am Currently doing my degree in information systems. At the moment the subject is PLC(Processing and Logic Concepts)

I understand all of it, I am not sertain on how to start reducing a boolean expression. Once the first step is done I normally get it and can complete the process of reduction using the Laws.

Does anyone know if i hint or a trick on where to start reducing a Boolean Expression

EX. F = AB'C + ABC + A'B'C' + A'BC'

I am not looking for the answer to the expression only a tip on how to start reducing these tipes of Expressions.

Thank You in Advance
 
Physics news on Phys.org
I'm no expert on this but the first thing I would do is start looking for "similarities" in the terms. For example, I see both A and C in the first two, both A' and C' in the second two:

F= AB'C+ ABC+ A'B'C'+ A'BC'= A(B+ B')C+ A'(B+ B')C'
and, of course, those two now have the same "B+ B' " so is the same as
F= (B+ B')(AC+ A'C')_

You haven't said what you consider "reduced to its lowest form".
 
HallsoIvy

Thank You for your reply. It helped me alot. What I mean by Reduced to its lowest form is - The Boolean Expression is reduced to a point where no more Laws or Rules can be applied to the remainder of the original expression.

Would I be correct if I reduced the expression from where you stopped to :

F = (B+B')(AC+A'C')
= (1)(AC+A'C')
= AC + A'C'
= AC

Thank You for your help
 
George SA said:
HallsoIvy

Thank You for your reply. It helped me alot. What I mean by Reduced to its lowest form is - The Boolean Expression is reduced to a point where no more Laws or Rules can be applied to the remainder of the original expression.

Would I be correct if I reduced the expression from where you stopped to :

F = (B+B')(AC+A'C')
= (1)(AC+A'C')
= AC + A'C'
= AC

Thank You for your help

Stop at F = AC + A'C', you can't justify the last line.
 
Thanks I see what you mean. I went to class last night and the same was said to me on how to start these expressions. Look for similarities, Thank You again for your assistance I am almost sure I got this now
 
The last line can actually be done using an XNOR gate.

BiP
 
I am studying the mathematical formalism behind non-commutative geometry approach to quantum gravity. I was reading about Hopf algebras and their Drinfeld twist with a specific example of the Moyal-Weyl twist defined as F=exp(-iλ/2θ^(μν)∂_μ⊗∂_ν) where λ is a constant parametar and θ antisymmetric constant tensor. {∂_μ} is the basis of the tangent vector space over the underlying spacetime Now, from my understanding the enveloping algebra which appears in the definition of the Hopf algebra...

Similar threads

  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 20 ·
Replies
20
Views
5K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
6K
  • · Replies 7 ·
Replies
7
Views
3K
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
4K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 3 ·
Replies
3
Views
3K
Replies
4
Views
6K