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.
A low level regular expression library that uses deterministic finite automata.
Rust re-implementation of OpenFST - library for constructing, combining, optimizing, and searching weighted finite-state transducers (FSTs). A Python binding is also available.
Frame is a markdown language for creating state machines (automata) in Python as well as generating UML documentation.
A persistent state machine for redis
An implementation of the Tsetlin Machine in Rust
GLR, LR(1) LALR(1) parser generator for Rust with custom reduce action
Sandbox cellular automata simulation in web
A Model Checker in Rust
Regex parser & NFA visualizer
🦠 Particles of different colors attract or repel each other. Simple rules generate complex behavior.
Manipulation, regular expression and automaton library. Allows conversion of regular expressions into automata and analysis of automata and their orbits.
Deterministic Finite-State Automata Library for Rust, written in L1