and(abc)(b-ac)
are equally correct input strings (they are even the same expression since (a AND b AND c) OR (b AND NOT a AND c) is the same as (c AND b AND NOT a) OR (b AND c AND a)).(cb-a)(bca)
But the output of the first reduction would be
and of the second reduction(bc)
(cb)
which would result in(-a-b-c-d)(-c-da-b)
(-b-c-d)
In reply to RE: Re: Boolean algebra
by le
in thread Boolean algebra
by le
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |