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.

State Machine for PHP

• UpdatedAug 6, 2023
• PHP

Finite-State Machine (FSM) for Arduino

• UpdatedSep 30, 2023
• C++

🌁 Nondeterministic Finite State Automata for Java (in plain English: flowcharts with multiple possible outcomes)

• UpdatedOct 19, 2025
• Java

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

• UpdatedAug 16, 2023
• C++

VUTBR - FIT: TIN 2018/2019

• UpdatedJan 13, 2019
• TeX

Deterministic finite automaton

• UpdatedApr 22, 2021
• C++

FlyWeight Finite Automata Simulator

• UpdatedFeb 24, 2025
• C#

learning haskell

• UpdatedFeb 14, 2015
• Haskell

A simple generic library to implement FSMs (Finite-State Machines) and the State Design Pattern in PHP.

• UpdatedMay 31, 2021
• PHP