Afinite-state machine (FSM),finite-state automaton (FSA), or simplystate machine is a mathematicalmodel of computation and anabstract 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 atransition.

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 ofhardware digital systems,software engineering,compilers,network protocols, andcomputational linguistics.

DFA regular expression library & friends

• UpdatedNov 5, 2025
• C

Solutions to Susanna Epp's Discrete Mathematics book, 5th Edition

• UpdatedAug 29, 2025
• TeX

Various utilities regarding Levenshtein transducers. (Java)

• UpdatedDec 20, 2021
• Java

A python library to manipulate formal languages and various automata

• UpdatedSep 4, 2025
• Python

Deterministic Finite Automata in C++, Token Parser & Lexer

• UpdatedJan 28, 2013
• C++

State machine creation framework written in Swift inspired by GKStateMachine from Apple GameplayKit

• UpdatedJan 28, 2018
• Swift

Finite-state script normalization and processing utilities

• UpdatedNov 3, 2025
• Python

Resources for morphological analysis of Portuguese

• UpdatedApr 1, 2025
• Lex

State Machine for PHP

• UpdatedAug 6, 2023
• PHP

Python FSA constructor, determinizer, and minimizer.

• UpdatedMar 26, 2008
• Python

Finite Automata and Regular Expressions for Regular Languages in Haskell

• UpdatedJun 2, 2021
• Haskell

Create and simulate finite state machines in your browser. Includes interactive exercises.

• UpdatedNov 4, 2017
• JavaScript

Binstate is a simple but yet powerful state machine for .NET. Thread safe. Supports async methods. Supports hierarchically nested states.

• UpdatedJul 17, 2025
• C#

Crea un automa riconoscitore che riconosce 1 o più sequenze

• UpdatedNov 14, 2024
• Python

ZOPSEDU Integrated University Management system framework with ZOPS Development Platform

• UpdatedMay 1, 2023
• JavaScript

Finite state machine library based on C++20 coroutine symmetric transfer

• UpdatedAug 16, 2023
• C++

A classic finite state automaton framework for JVM Applications (Android and jMonkeyEngine Applications).

• UpdatedAug 28, 2023
• Java

Tool for automatic inference of minimal finite-state models of function blocks from execution scenarios and temporal properties

• UpdatedJan 14, 2022
• Kotlin

C++ implementation of the DFA, NFA and e-NFA

• UpdatedDec 22, 2013

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)

• UpdatedAug 3, 2020
• Python