A library that implements formal finite state automata.
Desktop app for converting NFA (Non Deterministic Finite Automata) to DFA (Deterministic Finite Automata)
A C++ Automata simulator that models and visualizes automata using JSON inputs and generates .dot files for visualization. Built for the "Languages & Automata" 1st bachelor course at the University of Antwerp.
Important programs for Automata Lab for C.S.E 4th Sem.
This tool dynamically converts a defined NFA (Nondeterministic Finite Automaton) to a DFA (Deterministic Finite Automaton), generates the transition table, and visualizes the graph.
fsmconv is a command-line tool for converting FSA from one to another representation.
A cpp program to simulate a DFA or an NFA and convert the NFA to a corresponding DFA
Theory of languages and automata projects in forth semester of university
编译原理实验一,Haskell绝赞复刻-ing
This tool is used to convert non-deterministic finite automata (NFA) to deterministic finite automata (DFA) through an interactive and visual interface.
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.
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 🔀
FlyWeight Finite Automata Simulator
NFA to DFA Convertor written with JS
Regex -> ε-NFA -> DFA -> minDFA, lexical analysis
Midterm project of Theory of languages and automata - Mentorship
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."