Question: Complete source code in either C++ or Java. Please implement a translation from eNFA to NFA. You are given the freedom to choose the data
Complete source code in either C++ or Java.
Please implement a translation from eNFA to NFA. You are given the freedom to choose the data structures for representing NFAs. eNFA is the input. Use the 5 Tuple definition of an eNFA to specify your input eNFA.
You can use any data structure to represent the entry in the transition function and the sets of states etc.
Your output will be an NFA in the 5 tuple format.
The transition function entries should be printed in a table format. eg. q1 on a is {q4,q5 ... }.
Show how to input an eNFA. I should be able to enter any enfa (in the format you specify) and the output should be the equivalent nfa.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
