NFA to DFA converter, DFA minimization, FA acceptance in Haskell
-
Updated
Jul 22, 2023 - Haskell
NFA to DFA converter, DFA minimization, FA acceptance in Haskell
A lex program which convert NFA to DFA and simulate DFA using its transtion table. and return matches or not
regular expressions and deterministic and non-deterministic finite automata - simulator and analysis software
Regex --> Postfix --> NFA --> DFA --> MinDFA
Add a description, image, and links to the subset-construction topic page so that developers can more easily learn about it.
To associate your repository with the subset-construction topic, visit your repo's landing page and select "manage topics."