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
北京邮电大学 2023-2024 春季学期《形式语言与自动机》课程实验——NFA 到 DFA 的转化
From a image containing the handwritten automaton, generating the latex code from it.
A JavaFX-based tool for visualizing, editing, and minimizing DFAs (Deterministic Finite Automata), enabling users to efficiently create, optimize, and work with state machines in a user-friendly interface.
Implementation of finite-state machines and exportation to dot format
Input a Regex, get its AST, NFA, DFA and finally it Minimized DFA (Compiler Course Assignment)
This is about DFA optimization/Minimization in C program
University project automata theory languages and computation
Convert regular expressions to automata effortlessly with Regex2FA. Explore languages, visualize transitions, and compare expressions.
A Tool for Drawing the DFA/NFA of a Regex for a Regular Language
Program to make NFA from Regular Expression and make it to DFA then simplify it! Then parse a Pascal program.
A regular expression library that compiles regular expressions to DFAs.
Open source Auatamatan-webapp for converting Nfa to DFA and Minimizing DFA Machines!
Add a description, image, and links to the dfa-minimization topic page so that developers can more easily learn about it.
To associate your repository with the dfa-minimization topic, visit your repo's landing page and select "manage topics."