CSC 216/s08/clever imaginings: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 8: | Line 8: | ||
===The problem=== | ===The problem=== | ||
Finite state machines are abstract models of systems that contains a set number of states, inputs into the system, and ways of transitioning from one state to another. In simpler terms, a FSM is a model of a bunch of states and how a system moves from state to state. However, understanding all the parts of a FSM can be difficult, especially with systems with a large number of transitions or recursion involved. | |||
===Participants and props=== | ===Participants and props=== | ||
Revision as of 21:42, 15 April 2008
Formatting Resources
Formatting Help Guide from MetaWiki
Place Title of Exercise Here
Give the title of your exercise, which may include the name of the topic you are covering, or some other catchy title.
The problem
Finite state machines are abstract models of systems that contains a set number of states, inputs into the system, and ways of transitioning from one state to another. In simpler terms, a FSM is a model of a bunch of states and how a system moves from state to state. However, understanding all the parts of a FSM can be difficult, especially with systems with a large number of transitions or recursion involved.
Participants and props
How many students will participate? What else do you need (e.g., old tennis ball, Powerpoint slides, software).
The script
Describe how to do your exercise.