Description: achieve NFA Number algorithm to determine procedures. DFA NFA is a special case. NFA N for each must exist a DFA M, makes L (M) = L (N). N for each NFA exist with the DFA M equivalent. NFA from the matrix can be seen, tables are usually set of a state, and in the matrix DFA said, Form is a state of the corresponding NFA DFA basic structure of ideas : 1.DFA each one corresponds to a group of NFA state. 2. DFA use it to the state records in NFA Reading input into a symbol after all reach the state. .
- [ Lexical analysis grammar analysis regulation rar] - A quite entire morphology analyzer gram
- [nfa_dfa] - seek formal expressions of the NFA (unce
- [DFA] - DFA, a set of finite automata algorithms
- [nfa] - NFA DFA correlation algorithm compiler p
- [zdxx] - Compilation Principle course design, sel
- [NFtoDFA] - Regular expression is converted to DFA a
- [N_DFA] - NFA into a formal style of the algorithm
- [Confirm_NFA] - NFA-based algorithms to determine the co
- [DFA] - Simple DFA finite automata may be based
- [2dfa] - 这是由RE转NFA再转DFA，最后识别的程序。参考了龙书和陈火旺的书，http:
File list (Check if you may need any files):
Download