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.
DFA regular expression library & friends
Everything awesome about XState
Chatto is a minimal chatbot framework in Go.
Tools for building Re-frame + React based web apps with graph and non-graph data models
Deterministic Finite Automata in C++, Token Parser & Lexer
State Machine for PHP
A C++11 Hierarchical State Machine Library
Binstate is a simple but yet powerful state machine for .NET. Thread safe. Supports async methods. Supports hierarchically nested states.
Real Time-Embedded Systems - Sharif University of Technology
A finite state machine library.
DocFsm is a lightweight documentation-, developing- and reverse- engineering tool to visualizing Finite State Machines (FSM) written in C or C++.
Finite state machine library based on C++20 coroutine symmetric transfer
Farzad Yousefzadeh's personal website
XState utilities for Angular
🛠️ A front-end application for the generation and visualisation of theoretical finite state machines.
Cooperative multitasking application framework for the ATmega328P
Simple, easy-to-use Finite State Machines for Java and Groovy
A Pythonic container interface for finite state machines.
MIT Course 6.004 - Computation Structures
SUTD 2020 10.009 The Digital World Code Dump