Let's start with the basic things. How are the logical addition, multiplication and negation defined?
Perhaps you would like to try to fill out the following table?
Well, it depends on the scenario. What bridge are we talking about? What function do we have?
I did my own, similar one, a while ago.... except I didn't include AC(capped)
And this is how I got F
I presume 1+1 reboots the thing and makes it 0?
Well, we were told to always do truth tables since we're just beginners.A truth table is the most basic way to do it, but it is tedious. This is very easy to simplify using the basic laws of Boolean algebra (BA).
Let's review some basic rules of BA. Let x be a binary variable.
How would you simplify xx?
What is (x + 1)? (1 + x)?
What is x.1? 1.x?
Did not know that! So,Some entries are wrong. For instance 1 + 1 is not 0, but 1. Remember that '+' here signifies the OR function.
2X + X^2 +1
That would be 1 times x? that's X.
Did not know that! So,
"xx" represents "x AND x".
Do you know what that is?
"x+1" represents "x OR 1", which is?
"1x" represents "1 AND x".
But yes, that would be the same as x.
Yes, CC. But, we only know how to simplify using Karno Map (translating the name from Hebrew).Can you see which columns are identical to F?