Day 28, Mat385

• Our quiz covers sections 8.1 and 8.2:
  • Boolean Algebras
  • The three sides of the same coin: truth functions, logic networks, and Boolean expressions

• No quiz next week! We'll be reviewing next Thursday.

• Your projects are due on Friday of next week; your reviews are due on the Friday of finals week, at midnight.

There were two methods we considered:

1. The Karnaugh map (for up to four variables)
2. Quine-McCluskey (for an arbitrary number of variables).

The results are actually not optimal in every case: we noticed that there were simplifications that we could make that were not "on the radar" of these two techniques. They are limited in that they produce a sum of products, and we might factor (say) to simplify an expression further.

• It's on to our final topic: Finite-State Machines.

  We will hit the first part, which is creating machines to do binary addition (among other things).

  The second part, Tuesday, will cover recognition -- another task of FSMs -- and then minimization: again, an optimization issue. We'll end today on a machine that we will want to optimize; the question is how do we do that?