Description:
Program that convert regular expression(RE) into Deterministic Finite Automaton(DFA)
Explanation:
Input :
Regular expression .
Output :
DFA as
- Set of states .
- Initial state .
- Accepting state .
- Transition table.
- Input alphabet .
The output should be represented DFA as a transition. And the input should be free for the user as the binary alphabet of a regular expression or alphabet of a,b,c both alphabets .
Documentation:
Also, prepare the documentation for the project. Note the document should contain theoretical background and the design and implementation of the project. Also, should contain all the details about the project such as main data structures, main components of the algorithm, design interface, the input, the output, etc .
Get Project Solution Now
Comments
Post a Comment