There are 4 repositories under dfa-minimization topic.
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.
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)
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!
Convert regular expressions to automata effortlessly with Regex2FA. Explore languages, visualize transitions, and compare expressions.
A programmtic automata renderer and minimizer
This is about DFA optimization/Minimization in C program
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.
Transforming a given deterministic finite automaton (DFA) into an equivalent DFA that has a minimum number of states
Fast and effective automaton software that can simulate acceptance tests in a state machine style also providing support for validation, minimization and complement generation.
NFA to DFA converter, DFA minimization, FA acceptance in Haskell
University project automata theory languages and computation
Principles of Compiler Design Programs
converting NFA to DFA with graphical interface
Various code for following conversion : Regular Expression -> NFA -> DFA -> Regular Expression
This Python tool transforms NFAs to DFAs, minimizes DFAs, and converts regular expressions to NFAs.
First partial project carried out for the computational mathematics course.
Midterm project of Theory of languages and automata - Mentorship
a c++ program that takes a dfa as input and output its minimum equivalence states partitions and corresponding minimum state transition table.
Regex -> ε-NFA -> DFA -> minDFA, lexical analysis