fsa
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 14 public repositories matching this topic...
Design System site for USDA Farm Production and Conservation products
-
Updated
Aug 27, 2025 - JavaScript
Create redux reducers for async behaviors of multiple actions.
-
Updated
Jan 12, 2023 - JavaScript
Simple finite state automaton, with some advanced operations.
-
Updated
Nov 10, 2018 - JavaScript
Easy type checked Flux Standard Action for TypeScript
-
Updated
Jul 4, 2020 - JavaScript
- Followers
- 28 followers
- Website
- github.com/topics/finite-state-machine
- Wikipedia
- Wikipedia