page_title: Finite-state machine
section_title: Representations
hierarchical_section_title: Finite-state machine / Representations
caption_attribution_description: English: Toaster oven state machine with entry and exit actions
context_page_description: A finite-state machine or finite-state automaton, finite automaton, or simply a state machine, is a mathematical model of computation. It is an abstract machine that can be in exactly one of a finite number of states at any given time. The FSM can change from one state to another in response to some inputs; the change from one state to another is called a transition. An FSM is defined by a list of its states, its initial state, and the inputs that trigger each transition. Finite-state machines are of two types—deterministic finite-state machines and non-deterministic finite-state machines. A deterministic finite-state machine can be constructed equivalent to any non-deterministic one.
  The behavior of state machines can be observed in many devices in modern society that perform a predetermined sequence of actions depending on a sequence of events with which they are presented.
caption: Fig. 1 UML state chart example (a toaster oven)
exif: {}