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 10 public repositories matching this topic...
Type-safe action creator utilities
-
Updated
May 28, 2020 - TypeScript
Fluent syntax for defining typesafe reducers on top of typescript-fsa.
-
Updated
Jan 4, 2023 - TypeScript
🐰 🐱 🐻 FSA-compliant promise middleware for Redux, supports referencing dispatcher/state in action.
-
Updated
Sep 23, 2018 - TypeScript
NFA and DFA simulator by Booker Martin
-
Updated
Mar 22, 2021 - TypeScript
Easy type checked Flux Standard Action for redux-saga in TypeScript
-
Updated
Oct 25, 2018 - TypeScript
- Followers
- 27 followers
- Website
- github.com/topics/finite-state-machine
- Wikipedia
- Wikipedia