Repository navigation
Automaton
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 module (C extension and plain python) implementing Aho-Corasick algorithm
🤖 RxSwift + State Machine, inspired by Redux and Elm.
A Python library for simulating finite automata, pushdown automata, and Turing machines
🌾 Harvest: Apple's Combine.framework + State Machine, inspired by Elm.
A low level regular expression library that uses deterministic finite automata.
🤖 ReactiveCocoa + State Machine, inspired by Redux and Elm.
Zero-cost state-machine library for robust, testable and portable user interfaces (most machines compile ~1-2KB)
Reactive + Automaton + VTree in Swift, inspired by Elm.
Elm/React.js-like architecture in Swift, powered by ReactiveSwift and LayoutKit.
Visual Automata is a Python 3 library built as a wrapper for the Automata library to add more visualization features.
An implementation of the LSTAR Grammatical Inference Algorithm
An ecosystem of packages to work with automaton and parsers (dfa/nfa/e-nfa/regex/cfg/pda)
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.
A toy deadlock detector written in Go. 🔍