An implementation of regular expressions for Rust. This implementation uses finite automata and guarantees linear time matching on all inputs.
-
Updated
May 21, 2024 - Rust
An implementation of regular expressions for Rust. This implementation uses finite automata and guarantees linear time matching on all inputs.
Python module (C extension and plain python) implementing Aho-Corasick algorithm
A Python library for simulating finite automata, pushdown automata, and Turing machines
🎉The Sonic UIAutomation Driver Core. Sonic UI自动化Driver核心。
A low level regular expression library that uses deterministic finite automata.
The jBPT code library is a compendium of technologies that support research on design, execution, and evaluation of business processes. The library offers a broad range of basis analysis and utility functionality and, due to its open publishing model, can easily be extended.
An implementation of the LSTAR Grammatical Inference Algorithm
🌾 Harvest: Apple's Combine.framework + State Machine, inspired by Elm.
Goal-Oriented Action Planning implementation in Python
VATA Tree Automata Library
Zero-cost state-machine library for robust, testable and portable user interfaces (most machines compile ~1-2KB)
Visual Automata is a Python 3 library built as a wrapper for the Automata library to add more visualization features.
🤖 ReactiveCocoa + State Machine, inspired by Redux and Elm.
A Python package for automata theory.
Elm/React.js-like architecture in Swift, powered by ReactiveSwift and LayoutKit.
An ecosystem of packages to work with automaton and parsers (dfa/nfa/e-nfa/regex/cfg/pda)
Implementation of a Pushdown Automaton, the recognizer module of Context-Free Languages.
Add a description, image, and links to the automaton topic page so that developers can more easily learn about it.
To associate your repository with the automaton topic, visit your repo's landing page and select "manage topics."