第3章词法分析精选.ppt

DFA的最小化算法—英文描述 1. Construct an initial partition∏ of the set of states with two groups:the accepting states F and the nonaccepting states S-F. 2. Apply the procedure PP. to ∏ to construct a new partition ∏new. 3. If ∏new =∏,let ∏final=∏ and continue with step (4). Otherwise,repeat step(2) with ∏:= ∏new. 4. Choose one state in each group of the partition ∏final as the representative for the group.the representatives will be the states of the reduced DFA M’.let s be a representative state, and suppose on input a there is a transition from s to r on a. Let the start state of M’ be the rep