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.
-
Updated
Dec 31, 2017 - C++
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.
Converts a given regular expression into a NFA(Thompson's construction) then converts that NFA to a DFA(Subset construction)
根据正则表达式生成其对应 DFA 的状态转移图
Lab Experiments for the Compiler Design Lab
A cpp program to simulate a DFA or an NFA and convert the NFA to a corresponding DFA
🔃 Turing Machine, NFA, DFA, DFA Minimization, Finite Machines, Language Description, NFA to DFA, Prefix to Postfix, Sudoku Solver, Turing Machine Simulator 🔀
Important programs for Automata Lab for C.S.E 4th Sem.
编译原理实验一,Haskell绝赞复刻-ing
Theory of Computation | Conversion from NFA to DFA
converting NFA to DFA with graphical interface
AUT Formal Languages and Automata course programming assignment
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)
Theory of Machines and Languages Project
fsmconv is a command-line tool for converting FSA from one to another representation.
Graphical interface for designing finite automata
Regex -> ε-NFA -> DFA -> minDFA, lexical analysis
A library that implements formal finite state automata.
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."