Day 28, Mat385

Last time

Next time

Announcements
- The Zooms continue
  A menu of our past zooms...
- Homework:
  - 8.3: #8, 17, 28
- I hope that you're working on your projects!
  When you're ready email me and I'll activate it. That way we'll know that it's just been sent out.
  A couple more have emailed me in the last day. But we're still a long way from getting everyone set up....
  Projects are due by the last day of class, Thursday, by midnight. That means uploaded to the Wiki, and everything.
  Those who submit a project will then be assigned a couple to evaluate 2 other projects.
- Our final exam:
  1. Will be Thursday, 5/12, 4:40-6:40pm.
  2. It will be a two-hour, cumulative exam.
  3. It will be half new and half old material.
  4. You will be allowed a page of notes, front and back.
  5. Some old finals
  6. You might check the daily agendas for the reviews of our previous exam material. Certainly look over the old exams, and keys.
  7. New material (covered since the last exam): 6.3, 7.2, 7.3, 7.4, 8.1, 8.2, 8.3, and 9.3 (that's a lot of material).
  8. I'll have some review problems on Thursday.
Last time:
- We started Section 9.3: Finite-State Machines.
  We hit the first part, which is creating machines to do binary addition (among other things).
Today:
- Today we hit the second part of Section 9.3: recognition (and minimization).
  I made a handout (distributed last time), so that you can play along.
Links:
- I love FSMs, and have implemented them in lisp, etc. But I was 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 (but you won't need it to just run my examples).
  2. Open up My binary adder FSM at InsightMaker. If you have an account you can "Clone" it (upper right) -- then you'll own your own copy (and can change it to make your own FSM, or give your own input).
  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. I wrote this little bit of code to create the input in the right form:
    
    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.
- Shannon's 1938 paper A symbolic analysis of relay and switching circuits (here's a local copy)
- George Boole's biography
- Dijkstra's Algorithm (defined recursively): once a node is settled, its job is done. It can be "swallowed up" into a smaller graph, where its use as a shortcut has generally reduced the distance between other pairs of nodes.
  This was fun to program, but probably more trouble than it was worth. A direct approach, as in my implementation of Bellman-Ford below, would have been simpler to code. But, if I can do something recursively, I probably will...:)
- Bellman-Ford Algorithm: Bellman-Ford finds the shortest distances between the starting node and every other node, and the paths. It starts with paths of length one (the adjacency matrix row for the start node), and then adds in successively longer paths (and can't add more than n-1, or it would be repeating nodes -- which would make no sense).
- Floyd's algorithm: finds the shortest distances between any two nodes, but doesn't contain any path information.
- Graph traversals:
- EulerPath:
- Distilling Free-Form Natural Laws from Experimental Data. A computer rediscovers Newton's laws -- in a day!
  - Supplementary Material On-line
- Graph Terminology Handout
- Tree Terminology Handout
- If you check out this code, you'll see where I compute the power set ("all-subsets") of a set, to cover all the bases. I think that the end result is pretty beautiful, too!
- Recursive in-order, post-order, pre-order in lisp
- Recursive computation of Fibonacci numbers (in lisp)
- Recursive computation of rows from Pascal's triangle (in lisp)
- "String exponention" (in lisp)
- Here is the recursive selection sort algorithm, in lisp:
- Here is a recursive binary search algorithm in lisp:
- Closed-form computation of Fibonacci numbers (in lisp)
- Some examples of the Euclidean algorithm:
  1. Simple and clean recursive Euclidean Algorithm in lisp:
  2. Written as a while loop, using the recurrence relation:
- Here is a recursive bubbleSort algorithm in lisp
  
  (coded up following our author's algorithm, in section 3.3, p. 214, as closely as possible).
Details on why Dijkstra and Bellman-Ford work.

Website maintained by Andy Long. Comments appreciated.