编译原理NFA到DFA转换 - CSDN文库

需积分: 42 85 浏览量更新于2023-05-19 收藏 54KB DOC 举报

身份认证购VIP最低享 7 折!

领优惠券(最高得80元）

资源详情

资源推荐

1．分别求 ε-closure

ε-closure(0) = {0,1,2,4,7}

ε-closure(1) = {1,2,4}

ε-closure(2) = {2}

ε-closure(3) = {1,2,3,4,6,7}

ε-closure(4) = {4}

ε-closure(5) = {1,2,4,5,6,7}

ε-closure(6) = {1,2,4,6,7}

ε-closure(7) = {7}

ε-closure(8) = {8}

ε-closure(9) = {9}

2．转换算法：

ε-closure(0) = {0,1,2,4,7} = A

ε-closure(move(A,a))=ε-closure({3,8})={1,2,3,4,6,7,8} = B

ε-closure(move(A,b))=ε-closure({5})={1,2,4,5,6,7} = C

ε-closure(move(B,a))=ε-closure({3,8}) = B

ε-closure(move(B,b))=ε-closure({5,9})={1,2,4,5,6,7,9} = D

ε-closure(move(C,a))=ε-closure({3,8}) = B

ε-closure(move(C,b))=ε-closure({5}) = C

ε-closure(move(D,a))=ε-closure({3,8}) = B

ε-closure(move(D,b))=ε-closure({5}) = C

本内容试读结束，登录后可阅读更多

下载后可阅读完整内容，剩余1页未读，立即下载

qq_39392768

粉丝: 0
资源: 1

会员权益专享

图片转文字

全年可省5，000元立即开通

最新资源

资源上传下载、课程学习等过程中有任何疑问或建议，欢迎提出宝贵意见哦~我们会及时处理！点击此处反馈