Theory of Computation | Conversion from NFA to DFA
-
Updated
Jul 14, 2019 - Java
Theory of Computation | Conversion from NFA to DFA
Converts a given regular expression into a NFA(Thompson's construction) then converts that NFA to a DFA(Subset construction)
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."