The fast scanner generator for Java™ with full Unicode support

A Python package for automata theory.

1. Use Thompson algorithm to convert the regular expression to NFA 2. Use the subset construct to convert NFA to DFA 3. Minimize DFA to MFA 4. Use MFA to match strings

🍁 Compiler Compiler based on CSharp with GUI Program

Graphical interface for designing finite automata

A Web Application to convert NFA to DFA.

根据正则表达式生成其对应 DFA 的状态转移图

A python program to minimize any given DFA

From a image containing the handwritten automaton, generating the latex code from it.

Input a Regex, get its AST, NFA, DFA and finally it Minimized DFA (Compiler Course Assignment)

Open source Auatamatan-webapp for converting Nfa to DFA and Minimizing DFA Machines!

Program to make NFA from Regular Expression and make it to DFA then simplify it! Then parse a Pascal program.

This is about DFA optimization/Minimization in C program

Convert regular expressions to automata effortlessly with Regex2FA. Explore languages, visualize transitions, and compare expressions.

A programmtic automata renderer and minimizer

Implementation of finite-state machines and exportation to dot format

Transforming a given deterministic finite automaton (DFA) into an equivalent DFA that has a minimum number of states

A regular expression library that compiles regular expressions to DFAs.

Fast and effective automaton software that can simulate acceptance tests in a state machine style also providing support for validation, minimization and complement generation.

Principles of Compiler Design Programs