Finite-state machine

Topic | v1 | created by jjones |

A finite-state machine (FSM) or finite-state automaton (FSA, plural: automata), 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.


subtopic of Computer science

Computer science is the study of computation and information. Computer science deals with theory of c...

Edit details Edit relations Attach new author Attach new topic Attach new resource

treated in State machines are wonderful tools

10.0 rating 3.0 level 10.0 clarity 5.0 background – 1 rating

I love when my current problem can be solved with a state machine. They’re fun to design and implemen...