A Python package for automata theory.
Graphical interface for designing finite automata
根据正则表达式生成其对应 DFA 的状态转移图
Lab Experiments for the Compiler Design Lab
A basic Implementation of a Deterministic Finite State Automaton (DFA), Non-Deterministic Finite State Automaton (NFA) and Fallback DFA with Actions (FDFA) along with the Left Recursion Elimination algorithm for a Context-Free-Grammar (CFG)
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.
Pure-Python library for building and working with nondeterministic finite automata (NFAs).
Midterm project of Theory of languages and automata - Mentorship
AUT Formal Languages and Automata course programming assignment
NFA to DFA Convertor written with JS
Theory of Computation | Conversion from NFA to DFA
Converts a given regular expression into a NFA(Thompson's construction) then converts that NFA to a DFA(Subset construction)
Regex -> ε-NFA -> DFA -> minDFA, lexical analysis
converting NFA to DFA with graphical interface
🔃 Turing Machine, NFA, DFA, DFA Minimization, Finite Machines, Language Description, NFA to DFA, Prefix to Postfix, Sudoku Solver, Turing Machine Simulator 🔀
Conversion from Non-Deterministic Finite automata (NFA) to Deterministic Finite automata (DFA)
FlyWeight Finite Automata Simulator
Theory of Machines and Languages Project
To associate your repository with the nfa2dfa topic, visit your repo's landing page and select "manage topics."