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.

Simulations of deterministic finite automata in different languages!

Learning rust by playing around with NFAs

Potata regex engine

Provides a regular expression engine that uses a Nondeterministic finite automaton to simulate the regular expression

This Rust program implements a simulator for a non-deterministic finite automaton (NFA) with epsilon transitions (ε-NFA). The program reads a definition of the automaton from input, processes a set of input strings, and outputs the sets of states the automaton occupies for each character of the input strings.

Finite-state machines for Rust