Reduction of Boolean Expression to its Lowest From

  • Context: Undergrad 
  • Thread starter Thread starter George SA
  • Start date Start date
  • Tags Tags
    Expression Reduction
Click For Summary

Discussion Overview

The discussion revolves around strategies for reducing Boolean expressions to their lowest form, specifically in the context of processing and logic concepts. Participants explore methods for identifying similarities in terms and applying Boolean laws to achieve simplification.

Discussion Character

  • Exploratory
  • Technical explanation
  • Debate/contested

Main Points Raised

  • One participant seeks tips on how to start reducing a Boolean expression, providing an example for context.
  • Another participant suggests looking for similarities in the terms of the expression as a starting point for reduction.
  • A participant clarifies their understanding of "reduced to its lowest form" as a state where no further laws can be applied.
  • There is a proposed reduction of the expression that leads to a simplified form, but a later reply challenges the justification of the final step in the reduction process.
  • One participant mentions that the last line of the reduction could be represented using an XNOR gate, introducing a different perspective on the expression's simplification.

Areas of Agreement / Disagreement

Participants generally agree on the importance of identifying similarities in terms for reduction, but there is disagreement regarding the justification of certain steps in the reduction process, indicating that the discussion remains unresolved.

Contextual Notes

Participants express varying interpretations of what constitutes the lowest form of a Boolean expression and the validity of specific reduction steps, highlighting potential limitations in definitions and assumptions.

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 a lot. 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 a lot. 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
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 20 ·
Replies
20
Views
5K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
  • · 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