Converts a given regular expression into a NFA(Thompson's construction) then converts that NFA to a DFA(Subset construction)
-
Updated
Feb 2, 2018 - Java
Converts a given regular expression into a NFA(Thompson's construction) then converts that NFA to a DFA(Subset construction)
Implementation Of finite State Machines In JAVA
Add a description, image, and links to the dfa-to-regex topic page so that developers can more easily learn about it.
To associate your repository with the dfa-to-regex topic, visit your repo's landing page and select "manage topics."