Day 28: mat385

Last time

Next time

Today:

• Announcements:
  • Sorry I haven't gotten your homework from last week graded yet. I'm trying to catch up!

  • We have 22 projects submitted, and 27 students who have submitted them (5 projects are joint). Projects conducted by two students will get twice as many looks (4) as those conducted solo (2).

    Each of you will help me to evaluate them; you will each evaluate two other projects. The evaluations will be due by midnight, Wednesday, May 5th (prior to the start of our final). Each review should be at least two pages, typed.

    These reviews are entirely anonymous. I will be the only one to read your reviews, and I will not disclose your reviews with anyone. Please be entirely honest.

    Please use this rubric to evaluate your fellow students.

    Here are your projects to review.

  • Our final exam

    1. will be available from Thursday, 5/6, at 5:00pm until Saturday at midnight.
    2. It will be a two-hour, comprehensive exam.
    3. You will be allowed a page of notes, front and back.

  • We have one more "class session" on Friday. I'll wrap up FSMachines, and then give some review and expectations for the final. Please email with specific questions or concepts you'd like help with.
• Today: we focus on Finite-State Machines for recognition.
  • Finite-State Machines: recognition.
    1. For recognition (part 1)
    2. For recognition (part b, for better!)

  • The marked up pdf for Section 9.3.

• Links:
  • From last year: 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-hand side. 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.