Skip to content
#

fsm

Star

A finite-state machine (FSM), finite-state automaton (FSA), or simply state machine is a mathematical model of computation and 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.

In computer science, FSM are widely used in modeling of application behavior (control theory), design of hardware digital systems, software engineering, compilers, network protocols, and computational linguistics.

Here are 49 public repositories matching this topic...

Language: TypeScript
Filter by language
All 869 C++ 104 Python 94 C# 87 Go 74 JavaScript 70 C 66 TypeScript 49 Verilog 48 Java 46 VHDL 36
Sort: Fewest stars
Sort options
Most stars Fewest stars Most forks Fewest forks Recently updated Least recently updated
Followers
27 followers
Website
github.com/topics/finite-state-machine
Wikipedia
Wikipedia

Related topics

automaton deterministic-finite-automaton nondeterministic-finite-automaton