Regex -> ε-NFA -> DFA -> minDFA, lexical analysis
-
Updated
Jun 8, 2021 - Python
Regex -> ε-NFA -> DFA -> minDFA, lexical analysis
RegEx Visualizer is a powerful tool that allows you to visualize the process of converting regular expressions into Non-deterministic Finite Automata (NFA), Deterministic Finite Automata (DFA), and minimized DFA.
To associate your repository with the mindfa topic, visit your repo's landing page and select "manage topics."