An implementation of regular expressions for Rust. This implementation uses finite automata and guarantees linear time matching on all inputs.
-
Updated
Feb 10, 2023 - Rust
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
Lightweight Java State Machine
Netzob: Protocol Reverse Engineering, Modeling and Fuzzing
Python Finite State Machines made easy.
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 Python library for simulating finite automata, pushdown automata, and Turing machines
A regular expression converter
Zero-cost state-machine library for robust, testable and portable user interfaces (most machines compile ~1-2KB)
JavaScript library for working with automata and grammars for regular and context-free languages
Collection of helpful utilities we use in our Unity projects.
The Ultimate program analysis framework.
Wayeb is a Complex Event Processing and Forecasting (CEP/F) engine written in Scala.
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.
Temporal Logic Planning toolbox
Encoding Agnostic Validation (Validation Language, Parsers and Encoders)
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."