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
A feature-rich, yet simple finite state machine (FSM) implementation in C
Statechart library and editor
QP-nano real-time embedded framework/RTOS for embedded systems based on active objects (actors) and hierarchical state machines
Communicating Sequential Processes in Lua
A Minimalist Asynchronous Toolkit (AMAST) is a small and efficient C99 library that helps manage complex, event-driven programs. It combines the Actor model with hierarchical state machines to make building real-time systems easier.
Button Driver for Tactile Switches Buttons Compatible with ESP-IDF and STM32CubeIDE
Embedded state machine language with a just-in-time compiler for unparalleled speed and efficiency.
Simple and tiny framework of a synchronous, non-hierarchical, finite state maschine to manage system states
Embedded C projects completed while in attendance at CSUF, ADC, DAC, Matlab filter and FSM traffic light.
yacup: Yet Another C Utilities Package