in reply to Re: Boolean algebra
in thread Boolean algebra
Maybe I wasn't clear.
Of course there can be many negated variables like this:
- The order of variables in the output string had to be the same as the input string.
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)
Of course there can be many negated variables like this:
which would result in(-a-b-c-d)(-c-da-b)
(-b-c-d)
|
---|
Replies are listed 'Best First'. | |
---|---|
RE: RE: Re: Boolean algebra
by merlyn (Sage) on Nov 13, 2000 at 18:52 UTC | |
by le (Friar) on Nov 13, 2000 at 19:09 UTC |
In Section
Seekers of Perl Wisdom