第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 representative of the group containing the start state s0 of M,and let the accepting states of M’ be the representatives that are in F. Note that each group of ∏final either consists only of states in F or has no states in F. 5. If M’ has a dead state, that is, a states d that is no accepting and that has transition to itself on all input symbols, the remove d from M’,Also remove any states not reachable from the start state. Any transition to d from other states become undefined. 2 while （C中存在尚未被标记的子集T）do { 标记T； for 每个输入字母a do { U:= ?-closure(move(T,a))； if U不在C中 then 将U作为未标记的子集加在C中 } } NFA的确定化 例子 4 f 3 5 6 2 1 i ? ? ? ? a a a a b b b b 4 f 3 5 6 2 1 i ? ? ? ? a a a a b b b b 等价的DFA a C D B A E F S b a a a a a b b b b b a b F 确定有穷自动机的化简 说一个有穷自动机是化简了的，即是说，它没有多余状态并且它的状态中没有两个是互相等价的。一个有穷自动机可以通过消除多余状态和合并等价状态而转换成一个最小的与之等价的有穷自动机。 所谓有穷自动机的多余状态，是指这样的状态：从自动机的开始状态出发，任何输入串也不能到达的那个状态；或者从这个状态没有通路到达终态。 ? DFA的最小化就是寻求最小状态DFA 最小状态DFA的含义: 没有多余状态(死状态) 没有两个状态是互相等价（不可区别） 两个状态s和t可区别：不满足 兼容性——同是终态或同是非终态 传播性——从s出发读入某个a?a???和从 t出发读入某个a到达的状态等价。 C和D同是终态,读入a到达C和F, C和F同是终态, C和F读入a都到达C,读入b都到达E. C和D等价 a C D B A E F S b a a a a a b b b b b a b F 最小状态DFA 对于一个DFA M =（K,∑,f, k0,,kt)，存在一个最小状态DFA M’ =（K’,∑,f’, k0’,,kt’)，,使L(M’)=L(M). 结论 接受L的最小状态有穷自动机不计同构是唯一的。 “分割法” DFA的最小化算法的核心 把一个DFA的状态分成一些不相交的子集，使得任何不同的两子集的状态都