0
I have solved some issues of simplifying logical expressions, but I have felt some difficulty in simplifying them.
Like this one below:
I was given this logical circuit shown in the figure so that I could discover the most simplified output possible. I reached the result shown, applying Morgan’s law in the last league, first expression.
But I’m doubtful if it’s really simplified and if it’s simplified in the right way.
There’s another way?
The expression this correct or the law applied was mistaken?
Knows the Map of Karnaugh?
– Woss
Yeah, @Andersoncarloswoss
– Dwcleb
To add the tag, that’s not how the site works. The doubt is about boolean Lgebra, it is no use to keep adding unnecessary tag that does not help at all to filter the question. I suggest you stop, or your question will be blocked for editing then it will be worse for Voce.
– user28595
The tag [tag:architecture-computers] cites logic circuits, but in the context of when these are applied within the functioning of a computer, how it interacts within the architecture in question. Your question is only about Boolean algebra.
– Woss
Try to apply the Karnaugh map and compare the results. With the map you will arrive, by definition, in the simplest possible logical expression. Construct the truth table, see which of the maps (1 or 0) apply and do. For 3 entries the map is quite simple and fast;
– Woss
A f would be an xnor and not a xor
– Ken
Truth @Ken, thanks for the remark
– Dwcleb
Well, at first I found no mistake, and it’s normal to have difficulty finding the least boolean simplification that way. If you want to get the least simplification possible, I suggest taking a look at karnaugh map. If you search on google you will have several websites and videos about it. One of them is the one that saves me -> https://www.youtube.com/watch?v=YW-ylq0gE5w
– Rafael Camargo Geiss