An implementation of regular expressions for Rust. This implementation uses finite automata and guarantees linear time matching on all inputs.
-
Updated
Jun 9, 2024 - Rust
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
Sandbox cellular automata simulation in web
Regex parser & NFA visualizer
A Model Checker in Rust
🦠 Particles of different colors attract or repel each other. Simple rules generate complex behavior.
Deterministic Finite-State Automata Library for Rust, written in L1
A parser for dealing with Hanoi Omega-Automata (HOA) file format.
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."