Program to simulate a given NDFSM on an input string.
It reads in the NDFSM string from console and states, symbols, transition table from NDFA.txt file
and prints out whether the strings are accepted or rejected on the console.
"NDFA.txt" must have the following format:
First two lines have two integers representing number of states and number of input symbols respectively.
Second line denotes the number of final states.
Third line denotes the number of transitions from one state to other.
Fourth line denotes the transitions from one state to other as:
first three integer denotes the previous state, input symbol and total number of states it goes to and next two
represents about the states it goes to.
Note: While inputting the symbol in console please enter it giving one space among each symbol.