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.

Proc-macro typestate DSL for Rust

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

Find edge cases when solving C.P. problems easily!

Framework for (weighted) automata with storage

Sandbox cellular automata simulation in web

Living Neural implements the simplest form of a neural automata and renders the output using OpenGL.

Regex parser & NFA visualizer

🦠 Particles of different colors attract or repel each other. Simple rules generate complex behavior.

Introduction to compilers and language design

A Model Checker in Rust

Deterministic Finite-State Automata Library for Rust, written in L1

Manipulation, regular expression and automaton library. Allows conversion of regular expressions into automata and analysis of automata and their orbits.

Toy regular expressions implementation using finite automata.

A parser for dealing with Hanoi Omega-Automata (HOA) file format.