A FSM is a machine (physical or computer program) that consists of a fixed set of states. The FSM has a set of allowable inputs that change the state. The FSM has a set of possible outputs which depend on the current state (and thus the history of inputs which led to the current state)
Finite state automation (FSA)
A FSM with no outputs is called a finite state automation.
State Transition Diagrams
Are there to represent an FSM
State Transition Tables
Are there to represent an FSM
Decision Tables
Decision tables are a very useful tool when you are designing/testing algorithm. They let you map out all the possible combinations and what should happen..so that you can check you have handled them in the code.
Different notations
Well done - the only main point you are missing is that some FSM can have outputs on the state transitions as well as inputs
ReplyDelete