Introduction - If you have any usage issues, please Google them yourself
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.
Packet : 87361018nfa.rar filelist
NFA.doc