Last time | Next time |
That should certainly supercede a request from outside -- so if someone on floor 1 getting on the elevator pushes the 3 button, the elevator should not stop at floor 2 for a down request; but it should stop for an up request (if there's still time for a stop along the way).
This obviously complexifies the machine, and you'd need more states for in-motion between floors, and which direction. Let's not work that hard!:)
So we can give them all the same output.
Those who submit a project will then be assigned a couple to evaluate -- 2 other projects.
We looked at recognition and minimization.
Recognition is an important job that FSMs can do; and minimization is important for providing simpler, sleeker FSM to do those jobs.
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...:)
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....
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...:)
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!
(coded up following our author's algorithm, in section 3.3, p. 214, as closely as possible).