fsm
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 78 public repositories matching this topic...
WS-Machine is a websocket finite state machine for client websocket connections (Go)
-
Updated
Jul 10, 2017 - Go
minimal idiomatic Go FSM (finite state machine)
-
Updated
Oct 23, 2017 - Go
finite state machine generation tool
-
Updated
Jul 2, 2018 - Go
Yet Another Finite State Machine for golang
-
Updated
Oct 7, 2018 - Go
Design a bot's conversation flow
-
Updated
Nov 24, 2018 - Go
An Abstract Deterministic Finite State Machine/Transducer
-
Updated
Jan 24, 2019 - Go
Create a state transition graph (Moore FSM) from truth table having present state and next state values.
-
Updated
Mar 17, 2019 - Go
Finite State Machine for Go inspired by Akka FSM
-
Updated
Jan 22, 2020 - Go
Horizontally Scalable FSM storing states in MySQL
-
Updated
Mar 6, 2020 - Go
A simple finite state machine implementation
-
Updated
Jul 11, 2020 - Go
- Followers
- 31 followers
- Website
- github.com/topics/finite-state-machine
- Wikipedia
- Wikipedia