第二、三章习题讲解.PPT

* ?-closure(move(C,a)) = ?-closure({3}) = {1,2,3,4,6,7} ?-closure(move(C,b)) = ?-closure({5}) = {1,2,4,5,6,7} 则DFA为： 3.17 用算法3.2把练习3.16中的NFA转换成DFA。给出它们处理串ababbab的状态转换序列。 ?-closure({0}) = {0,1,2,3,4,6,7,8,10,11}=A ?-closure(move(A,a)) = ?-closure({5}) = {1,2,3,4,5,6,7,8,10,11}=B ?-closure(move(A,b)) = ?-closure({9}) ={1,2,3,4,6,7,8,9,10,11}=C * c) ((? |a)b*)* ?-closure(move(B,a)) = ?-closure({5}) = {1,2,3,4,5,6,7,8,10,11}=B ?-closure(move(B,b)) = ?-closure({9}) = {1,2,3,4,5,6,7,8,10,11}=C ?-closure(move(C,a)) = ?-closure({5}) = {1,2,3,4,