Loading Icon

Finite-state machine

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.

Metrics Summary

Total Publications
Lifetime
7,247
Prior Five Years
1,298
Total Citations
Lifetime
101,022
Prior Five Years
4,006
Total Scholars
Lifetime
7,717
Prior Five Years
5,713

Institutional Rankings

Global (Worldwide)
Show More
National Institutional Rankings

Publications and Citation History

Publications based on Disciplines

Scholars based on Disciplines

Publications based on Fields

Scholars based on Fields

Highly Ranked Scholars™

Lifetime
Prior Five Years

Highly Cited Publications

Lifetime