Day 25: mat385

Last time

Next time

• Announcements:
  • During class time I'll be on Zoom, should you have any questions.

    https://nku.zoom.us/j/7057440907.

  • Your 8.1 homeworks have been graded and returned (here's a "key" for the ones I graded). I haven't gotten to the 8.2 homeworks yet -- and here come the 8.3! I'm noticing a little fall-off in homework. We're in the final stretch -- just keep it in the road!

  • I've assigned one final homework, due next Wednesday. Then it's on to the final....

    Next week I'll do a few video summary lectures, and continue to take comments and questions during "class".

• Today:
  • Today we take a look at our final section, Finite State Machines (where once again it will feature optimization -- making things as elegant as possible).

    I've broken section 9.3 into two parts: last time we focused on representing and building some FSMs to do simple chores; today we focus on the job of recognition (which is important and fun), and minimization (which is important -- and fun, too, sometimes... sort of....:).

    So there will be two separate homework assignments for section 9.3.

    • Section9.3.part1.mp4
    • Section9.3.part2.mp4
    • Section9.3.part3.mp4: recognition

      • Exercise 36 -- Noticed I'd forgotten that!

    • Section9.3.part4.mp4: minimization
    • Marked up highlights of Section9.3

• Links:
  • We dropped the idea of projects. But here's mine!:) I love FSMs, and have implemented them in lisp, etc. But I've been using some compartmental modeling software for my math modeling class, and realized that we could use that for building a little FSM. So I thought that I'd make something useful -- the binary adder.

    So if you want to try the binary adder I created, here ya go. And it's easy enough to build other little machines (but there are certain pains, because we're using a tool which really wasn't intended for this....

    1. You can get a free account on InsightMaker

    2. Open up My binary adder FSM at InsightMaker. "Clone" it (upper right) -- then you'll own your own copy (and can change it to make your own FSM).

    3. You need to make two changes: set the two binary numbers' values, and then within "Settings" you need to set the length of the simulation. Then "Simulate" will run the machine, and generate the sum.

    4. This writes the input vectors for random integers (with padding), and tells what settings to fix, etc. Also the expected output, so one can confirm that the machine is working....

    5. The instructions are included in the insight, at right. I've made a little video to illustrate how it works -- to walk you through it. Take a stroll, if you like!:)

    6. I built a little FSM to do the recognition of Exercise 26b, p. 754 -- set of all strings where the number of 0s is a multiple of 3.