An implementation of regular expressions for Rust. This implementation uses finite automata and guarantees linear time matching on all inputs.
-
Updated
May 18, 2024 - Rust
An implementation of regular expressions for Rust. This implementation uses finite automata and guarantees linear time matching on all inputs.
Lightweight Java State Machine
Netzob: Protocol Reverse Engineering, Modeling and Fuzzing
Python Finite State Machines made easy.
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.
DFA regular expression library & friends
The Ultimate program analysis framework.
Temporal Logic Planning toolbox
A free, open-source Java library for modeling automata, graphs, and transition systems
JavaScript library for working with automata and grammars for regular and context-free languages
Unitex/GramLab Java IDE
A low level regular expression library that uses deterministic finite automata.
A regular expression converter
Unitex/GramLab C++ Core
An Automata Learning Library Written in Python
Collection of helpful utilities we use in our Unity projects.
🤖 A curated list of awesome resources related to finite state machines and statecharts.
Rust re-implementation of OpenFST - library for constructing, combining, optimizing, and searching weighted finite-state transducers (FSTs). A Python binding is also available.
Aho-Corasick string search algorithm PHP extension implementation.
Add a description, image, and links to the automata topic page so that developers can more easily learn about it.
To associate your repository with the automata topic, visit your repo's landing page and select "manage topics."