An implementation of regular expressions for Rust. This implementation uses finite automata and guarantees linear time matching on all inputs.

DFA regular expression library & friends

Python Finite State Machines made easy.

Lightweight Java State Machine

Netzob: Protocol Reverse Engineering, Modeling and Fuzzing

🤖 A curated list of awesome resources related to finite state machines and statecharts.

A low level regular expression library that uses deterministic finite automata.

A Python library for simulating finite automata, pushdown automata, and Turing machines

There is no state but what we make. Feel free to pitch in.

A regular expression converter

JavaScript library for working with automata and grammars for regular and context-free languages

Zero-cost state-machine library for robust, testable and portable user interfaces (most machines compile ~1-2KB)

The Ultimate program analysis framework.

Collection of helpful utilities we use in our Unity projects.

An Automata Learning Library Written in Python

A comprehensive autonomous decentralized systems framework for AI control architects.

Wayeb is a Complex Event Processing and Forecasting (CEP/F) engine written in Scala.

Rust re-implementation of OpenFST - library for constructing, combining, optimizing, and searching weighted finite-state transducers (FSTs). A Python binding is also available.

Proc-macro typestate DSL for Rust

🕸️ Graphs, finite fields and discrete dynamical systems in Kotlin