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)
A library that implements formal finite state automata.
Theory of Machines and Languages Project
Regex -> ε-NFA -> DFA -> minDFA, lexical analysis
Implementation of a Non-deterministic Finite Automaton in C++. The program can show the dead states, check if the NFA is a DFA and analyze a string to see if it belongs to the NFA.
Midterm project of Theory of languages and automata - Mentorship
This tool dynamically converts a defined NFA (Nondeterministic Finite Automaton) to a DFA (Deterministic Finite Automaton), generates the transition table, and visualizes the graph.
🔃 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)
AUT Formal Languages and Automata course programming assignment
FlyWeight Finite Automata Simulator
编译原理实验一,Haskell绝赞复刻-ing
NFA to DFA Convertor written with JS
A cpp program to simulate a DFA or an NFA and convert the NFA to a corresponding DFA
Important programs for Automata Lab for C.S.E 4th Sem.
fsmconv is a command-line tool for converting FSA from one to another representation.
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."