You are viewing a free preview of this lesson.
Subscribe to unlock all 10 lessons in this course and every other course on LearningBro.
A finite state machine (FSM) is a mathematical model of computation that can be in exactly one of a finite number of states at any given time. FSMs change state in response to inputs according to defined transition rules. They are covered in OCR H446 sections 1.4 and 2.1.
| Component | Definition |
|---|---|
| States | A finite set of conditions the machine can be in |
| Inputs | Symbols or events that cause the machine to change state |
| Transitions | Rules that define which state to move to for each input in each state |
| Start state | The state the machine begins in |
| Accept/final states | States that indicate the machine has completed successfully (in some FSMs) |
A Finite State Automaton (FSA) or Finite State Acceptor processes an input string and either accepts or rejects it. There is no output other than accept/reject.
Example — FSA that accepts strings ending in "01":
Subscribe to continue reading
Get full access to this lesson and all 10 lessons in this course.