编译原理第八讲素材.ppt

NFA的确定化 More example 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.(Construction of ∏new) 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 t .Let r be the representative of t’s group(r may be t).Then M’ has 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 representative 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 not accepting and that has transitions to itself on all input symbols, then remove d from M’,Also remove any states not reachable from the start state. Any transitions to d from other states become undefined. 人有了知识，就会具备各种分析能力， 明辨是非的能力。 所以我们要勤恳读书，广泛阅读， 古人说“书中自有黄金屋。 ”通过阅读科技书籍，我们能丰富知识， 培养逻辑思维能力； 通过阅读文学作品，我们能提高文学鉴赏水平， 培养文学情趣； 通过阅读报刊，我们能增长见识，扩大自己的知识面。 有许多书籍还能培养我们的道德情操， 给我们巨大的精神力量， 鼓舞我们前进。 * Compiler Construction Principles Formal Languages and Automata Compiler Construction Principles DFA是NFA的特例.对每个NFA 　N一定存在一个DFA　Ｍ ，使得 L(M)=L(N)。对每个NFA N存在着与之等价的DFA M。 有一种算法，将NFA转换成接受同样语言的DFA.这种算法称为子集法. 与某一NFA等价的DFA不唯一. 从NFA的矩阵表示中可以看出，表项通常是一状态的集合，而在DFA的矩阵表示中，表项是一个状态，NFA到相应的DFA的构造的基本思路是： DFA的每一个状态对应NFA的一组状态. DFA使用它的状态去记录在NFA读入一个输入符号后可能达到的所有状态. 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 确定有穷自动机的化简 说一个有穷自动机是化简了的，即是说，它没有多余状态并且它的状态中没有两个是互相等价的。一个有穷自动机可以通过消除多余状态和合并等价状态而转换成一个最小的与之等价的有穷自动机。