Description: In the non-deterministic finite automaton of the NFA, because of the transfer of certain state to be from a number of possible follow-up to the state to choose, so a NFA identification string of symbols must be on a trial process. This uncertainty to the recognition process brought about by repeated, it will undoubtedly affect the efficiency of the FA, so we need to determine of NFA.
File list (Check if you may need any files):
Download