DFA regular expression library & friends
-
Updated
May 31, 2024 - C
DFA regular expression library & friends
The following example is meant to demonstrate how a Deterministic Finite Automata(DFA) algorithm is supposed to guide identify whether a string is an email adress ending with .gov or .gr
RegEx Wizard v5.0
dregex is a Java library that implements a regular expression engine using deterministic finite automata (DFA). It supports some Perl-style features and yet retains linear matching time, and also offers set operations.
Limbaje Formale și Automate / Y1S2
An implementation of regular expressions for Rust. This implementation uses finite automata and guarantees linear time matching on all inputs.
A simple interpreted language for building Turing machines and other automata
An Automata Learning Library Written in Python
State Machine App is a web app for automata enthusiasts, offering seamless conversion of Non-Deterministic Finite Automata (NFA) to Deterministic Finite Automata (DFA) alongside advanced algorithms for DFA minimization and reduction. With its intuitive interface, powerful features,and simplify complex automata tasks, making it a better application.
DFA Minimization
A simplistic programming language interpreter to Python to help students grasp finite automata theory programmatically and with a computed graph through visualization libraries.
This is the "one": Linuxy infrastructureish mostly C++ code.
Pure OCaml regular expressions, with support for Perl and POSIX-style strings
A simple compile time dfa based regular expression library for C++20.
Add a description, image, and links to the dfa topic page so that developers can more easily learn about it.
To associate your repository with the dfa topic, visit your repo's landing page and select "manage topics."