Description: C++ programming with regular expressions to find NFA (not sure of the finite automata), NFA to DFA and DFA (finite automata) of the minimum
- [reg2NFA(java)] - Regular Expression to NFA, NFA to DFA s
- [DFA] - Enter a regular expression, the output c
- [SeuLexProject] - Analysis of the Lex input file of regula
- [111] - A brief description of ideas: 1, image b
File list (Check if you may need any files):
NFAtoDFA(C++).txt
Download