An automaton is a relatively self-operating machine designed to automatically follow a sequence of operations.
The term has long been commonly associated with automated puppets that resemble moving humans or animals, built to impress and/or to entertain people.
An implementation of regular expressions for Rust. This implementation uses finite automata and guarantees linear time matching on all inputs.
Python Finite State Machines made easy.
DFA regular expression library & friends
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 Python library for simulating finite automata, pushdown automata, and Turing machines
A low level regular expression library that uses deterministic finite automata.
There is no state but what we make. Feel free to pitch in.
A regular expression converter
The Ultimate program analysis framework.
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)
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.
Rust re-implementation of OpenFST - library for constructing, combining, optimizing, and searching weighted finite-state transducers (FSTs). A Python binding is also available.
Wayeb is a Complex Event Processing and Forecasting (CEP/F) engine written in Scala.
🕸️ Graphs, finite fields and discrete dynamical systems in Kotlin