I need to check my answers but I don't have a solution manual for this book, what is a good program to evaluate Boolean expressions?
Name:
Anonymous2007-05-19 21:43 ID:oN+Twidb
???
Name:
Anonymous2007-05-19 21:45 ID:E4JMRwTt
>>2
If I want to simplify the Boolean expression (A'B'+AB+A'C')(A'D+AB'+AC) and I'm not sure I did it right, how could I check if I did? Barring making a truth table for every problem...
Name:
Anonymous2007-05-19 23:36 ID:yOeUA0rw
Make a Karnaugh map
Name:
Anonymous2007-05-20 4:29 ID:ERUXjMkH
>>4
Doesn't the expression need to be in SoP form for me to do that? I'm not sure if I can change these expressions correctly in order to do that.
Name:
Anonymous2007-05-20 5:48 ID:wm86NJjd
false.
Name:
Anonymous2007-05-25 17:05 ID:MzX8E30P
Is this another of those NP complete problems?
Name:
Anonymous2007-05-25 17:19 ID:RMl3bH8f
This isn't evaluation, it's simplification. Computer algebra systems can do this: Maple or Mathematica, or one of the many open-source ones (most of the latter are shitty, but there are a few gems like GiNaC and YACAS).
Name:
Anonymous2007-05-25 21:57 ID:udjYtzQ2
Look up the "Quine-Mclusky" algorithm. Dunno about spelling on that.
Name:
Anonymous2007-06-03 6:12 ID:KhteJAfE
Trying to bump out my post. Please ignore this reply.