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
Solutions to Susanna Epp's Discrete Mathematics book, 5th Edition
Various utilities regarding Levenshtein transducers. (Java)
State machine creation framework written in Swift inspired by GKStateMachine from Apple GameplayKit
A python library to manipulate formal languages and various automata
Deterministic Finite Automata in C++, Token Parser & Lexer
Finite-state script normalization and processing utilities
Resources for morphological analysis of Portuguese
State Machine for PHP
Finite Automata and Regular Expressions for Regular Languages in Haskell
Create and simulate finite state machines in your browser. Includes interactive exercises.
Crea un automa riconoscitore che riconosce 1 o più sequenze
Binstate is a simple but yet powerful state machine for .NET. Thread safe. Supports async methods. Supports hierarchically nested states.
ZOPSEDU Integrated University Management system framework with ZOPS Development Platform
Tool for automatic inference of minimal finite-state models of function blocks from execution scenarios and temporal properties
C++ implementation of the DFA, NFA and e-NFA
A classic finite state automaton framework for JVM Applications (Android and jMonkeyEngine Applications).
A basic Implementation of a Deterministic Finite State Automaton (DFA), Non-Deterministic Finite State Automaton (NFA) and Fallback DFA with Actions (FDFA) along with the Left Recursion Elimination algorithm for a Context-Free-Grammar (CFG)
C++ Class of Finite Automata, visualization and operations
A model designed for an elevator that also checks the constraints and specifications for a finite state machine. Also contains a finite state machine for multiplication.