to be honest I don't know if this is the right place to ask my question but I don't know exactly where else i could do it...
my problem is that I have to write the Quine/Mc Cluskey code, but I am not understanding how it is working... I looked it up at wikipedia and on a lots of other sides, but they are never telling the way.
So if I have for example the following boolean function:
f(A,B,C) = (∼A ∧ ∼B ∧ ∼C) ∨ (∼A ∧ B) ∨ (A ∧ B ∧ ∼C) ∨ (A ∧ C)
then is the result: (∼A ∧ ∼C) ∨ (A ∧ C) ∨ (B)
∧ means and
∨ means or
∼ means negation
but how can I get it, I don't know the steps between there... can anybody help me... it would be really nice...