基于子集构造法的优化的NFA确定化算法.pdfVIP

21 1 Vol. 21 No. 1 2011 1 COM PUT R T CHNOLOGY AND D V LOPM NT Jan. 2011 NFA 任平红, 陈 矗, 曹宝香, 禹继国 (山东曲阜师范大学计算机科学学院, 山东 日照 276826) : , , - closure, - closure, , , , : ; ; ; : TP301. 1 : A : 1673- 629X( 2011) 01- 0070- 04 An Optim ized A lgorithm for Transition from NFA to DFA Based on Subset ConstructionM ethod R N Ping- hong, CH N Chu, CAO Bao- xiang, YU Ji- guo ( Co llege of Computer Science, Q ufu N ormalU niversity, R izhao 276826, China) Abstract: The problem of repetitive computing ex its in the process of transition from non- determ inistic finite automata to determ inistic finite automata using the subset constructionm ethod. To solve this problem, an optmi ized algorithm for transition from NFA to DFA is put forward on thebasis of characters ofN FA and according to shortcom ing sof the subset construction method. First, the concept that ef fective source state set for amark symbol is defined and the theorem that combination of- clo sure is proved. The theorem guarantees the rightnessof the follow ing algorithm s. Second, wt o sub algorithm s that construction of effective source state set foramark symbol and that computing - closure of a set w ith only one state are given. Based on these sub algorithm s, the optmi ized algorithm for transition from N FA to D FA is giv en. In the end, an expermi ent is carried out and the result show s that computing amount of this algorithm is far less than that of subset construction method. Comparing to subset constructionmethod, this algorithm can convertNFA to D FA more ef ficiently. Ke words: subset constructionm ethod; non- determ inistic finite autom ata; optmi ized; algorithm fo