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.

Finite-State Machine (FSM) for Arduino

• UpdatedSep 30, 2023
• C++

A C++ library for simulating automata and Turing machines

• UpdatedJun 14, 2023
• C++

Python implementation of a Deterministic Finite Automaton (DFA) with interactive testing. Verify input string acceptance and explore language processing concepts

• UpdatedJan 2, 2024
• Python

Formal Languages and Compiler Design 1. RE to FA 2. NFA to DFA 3. CFG to CNF

• UpdatedNov 5, 2021
• TypeScript

Pure-Python library for building and working with nondeterministic finite automata (NFAs).

• UpdatedAug 4, 2022
• Python

A teaching aid for concepts and algorithms in logic

• UpdatedJun 8, 2024
• Java

State machines for Laravel with Enums

• UpdatedApr 25, 2025
• PHP

A library and web app for simulating finite automatas (DFA, NFA, and ε-NFA) and regular expressions.

• UpdatedSep 20, 2025
• TypeScript

A regular grammar and finite automaton evaluator

• UpdatedJul 2, 2020
• Kotlin

This project includes classes and methods that are built to perform various operations on FAs.(Final project for Fundamentals of Computational Theory)

• UpdatedFeb 13, 2023
• Python

Implementation of a Finite Automaton Comparator in C++. The input finite automaton can be deterministic or non-deterministic.

• UpdatedDec 30, 2017
• C++

Deterministic finite automaton

• UpdatedApr 22, 2021
• C++

这是一个非常简单小巧的有限自动状态机。使用C++11开发，仅仅由一个头文件构成

• UpdatedOct 16, 2019
• C++

Finite Automaton

• UpdatedMay 12, 2022
• JavaScript

A Non-deterministic Finite Automaton (NFA) based Regular Expression Engine implemented in Scala. Supports basic regex operations, dot operator, and visualization using GraphViz.

• UpdatedFeb 3, 2025
• Scala

Finite automaton algorithms and turing machine

• UpdatedOct 25, 2021
• Python

A simple demonstration of Deterministic Finite Automaton

• UpdatedFeb 10, 2025
• Rust

Samples of algorithms to verify strings / words using finite machines.

• UpdatedJan 12, 2022
• Java

Interactive website for simulating variants of finite automata, Turing machines with 2D tapes, and k-queue automata

• UpdatedJan 26, 2023
• JavaScript