RE: Re: Boolean algebra

[le]

Maybe I wasn't clear.

• The order of variables in the output string had to be the same as the input string.

This means that

(abc)(b-ac)

and

(cb-a)(bca)

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)).

But the output of the first reduction would be

(bc)

and of the second reduction

(cb)

Of course there can be many negated variables like this:

(-a-b-c-d)(-c-da-b)

which would result in

(-b-c-d)

[merlyn]

Why is the second one (cb) and not (bc), since both orderings are in the input string? What permits me to pick one subexpression over the other? You still aren't clear, and the specification is still ambiguous to me.

-- Randal L. Schwartz, Perl hacker

[le]

Sorry for being ambigous.

Let's start over:
The whole expression ((...)(...)) can be simplified if the two partial expressions (inside the braces) differ in just one negated variable.

If the whole expression can be simplified, then the result is the first partial expression without the variable that differs. (So have to pick first partial expression.)

That's why (in these two examples) one output is (cb) and the other one is (bc)