MIT6_042JS10_lec12

MIT6_042JS10_lec12 - State machines Mathematics for...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
3/1/10± Albert R Meyer, March 3, 2010 Mathematics for Computer Science MIT 6.042J/18.062J State Machines lec 5W.1 Albert R Meyer, March 3, 2010 State machines step by step processes (may step in response to input ±not today) lec 5W.2 Albert R Meyer, March 3, 2010 State machines The state graph of a 99-bounded counter: States: {0,1,…,99, overflow } 0 start state 12 overflow 99 Transitions: 0 ± i < 99 i i+1 99 overflow overflow overflow lec 5W.3 Albert R Meyer, March 3, 2010 Die Hard Picture source: http://movieweb.com/movie/diehard3/ lec 5W.4 Albert R Meyer, March 3, 2010 Die Hard Simon says: On the fountain, there should be 2 jugs, do you see them? A 5-gallon and a 3-gallon. Fill one of the jugs with exactly 4 gallons of water and place it on the scale and the timer will stop. You must be precise; one ounce more or less will result in detonation. If you're still alive in 5 minutes, we'll speak. lec 5W.5 Albert R Meyer, March 3, 2010 Die Hard lec 5W.6 Image removed due to copyright restrictions.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 05/27/2011 for the course CS 6.042J taught by Professor Prof.albertr.meyer during the Spring '11 term at MIT.

Page1 / 5

MIT6_042JS10_lec12 - State machines Mathematics for...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online