Regex -> ε-NFA -> DFA -> minDFA, lexical analysis
-
Updated
Jun 8, 2021 - Python
#
mindfa
Here are 3 public repositories matching this topic...
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.
-
Updated
Apr 18, 2024 - Jupyter Notebook
Improve this page
Add a description, image, and links to the mindfa topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the mindfa topic, visit your repo's landing page and select "manage topics."