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)

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

A JavaFX-based tool for visualizing and minimizing DFAs (Deterministic Finite Automata), allowing users to easily create, edit, and optimize state machines.

This is about DFA optimization/Minimization in C program

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

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

Implementation of finite-state machines and exportation to dot format

北京邮电大学 2023-2024 春季学期《形式语言与自动机》课程实验——NFA 到 DFA 的转化

University project automata theory languages ​​and computation

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

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.