Desktop app for converting NFA (Non Deterministic Finite Automata) to DFA (Deterministic Finite Automata)
-
Updated
Jun 19, 2023 - Python
Desktop app for converting NFA (Non Deterministic Finite Automata) to DFA (Deterministic Finite Automata)
Theory of languages and automata projects in forth semester of university
Theory of Machines and Languages Project
🔃 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)
Midterm project of Theory of languages and automata - Mentorship
Regex -> ε-NFA -> DFA -> minDFA, lexical analysis
AUT Formal Languages and Automata course programming assignment
Pure-Python library for building and working with nondeterministic finite automata (NFAs).
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)
根据正则表达式生成其对应 DFA 的状态转移图
A Python package for automata theory.
Add a description, image, and links to the nfa2dfa topic page so that developers can more easily learn about it.
To associate your repository with the nfa2dfa topic, visit your repo's landing page and select "manage topics."