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)
Syntax tree method implementation to convert a regular expression to DFA.
A library that implements formal finite state automata.
Please read the Design Report.
A project containing data structures for different kinds of automata (DFAs/NFAs), a simple custom language defining operations on them, as well as a fully functional and customizable GUI editor.
Add a description, image, and links to the dfa-construction topic page so that developers can more easily learn about it.
To associate your repository with the dfa-construction topic, visit your repo's landing page and select "manage topics."