计算理论导论(英文版)正则语言ppt课件.ppt

计算理论导论(英文版)正则语言ppt课件.ppt

ID:59005649

大小:3.72 MB

页数:145页

时间:2020-09-27

计算理论导论(英文版)正则语言ppt课件.ppt_第1页
计算理论导论(英文版)正则语言ppt课件.ppt_第2页
计算理论导论(英文版)正则语言ppt课件.ppt_第3页
计算理论导论(英文版)正则语言ppt课件.ppt_第4页
计算理论导论(英文版)正则语言ppt课件.ppt_第5页
资源描述:

《计算理论导论(英文版)正则语言ppt课件.ppt》由会员上传分享,免费在线阅读,更多相关内容在教育资源-天天文库

1、Chapter1FiniteAutomata1MotivationThetheoryofcomputationbeginswithaquestion:Whatisacomputer?Itishardtosetupamanageablemathematicaltheoryofthemdirectly.Itisoftenusefulwhendevelopingknowledgeinanewfieldtostartbyconsideringrestrictedcasesandthengraduallyexpandtothegeneralcase.Suchanapproachallowsag

2、radualincreaseinthecomplexityoftheargumentation.2MotivationInparticular,itisaquitecommonstrategyintheinvestigationofinfinitesystemstostartbyconsideringfinitesubsystems.Forinstance,incompilers(i.e.,inprogramsthattranslateprogramswritteninhigh-levellanguagestoequivalentprogramswritteninmachinelan

3、guages)thelexicalanalyzersarebasicallydesignedasfinite-memoryprograms.Themaintaskofalexicalanalyzeristoscanthegiveninputsandlocatethesymbolsthatbelongtoeachofthetokens.3Centraltotheinvestigationoffinite-memoryprogramsistheobservationthatthesetofallthestatesreachableinthecomputationsofeachsuchpr

4、ogramisfinite.Asaresult,thecomputationsofeachfinite-memoryprogramcanbecharacterizedbyafinitesetofstatesandafinitesetofrulesfortransitionsbetweenthosestates.ModelsofcomputationdevicesforacceptingandgeneratinglanguagesFiniteautomataorfinite-statemachine45theregularoperationsLetAandBlanguages.Wede

5、finetheregularoperationsunion,concatenation,andstarasfollows.TheemptystringisalwaysamemberofA*.6additionalexampleExampleConsiderthelanguagesL1={,0,1}andL2={01,11}.TheunionoftheselanguagesisL1L2={,0,1,01,11},theirconcatenationisL1L2={01,11,001,011,101,111}.L1*={,0,1,01,10,001,100,….}ØL=Ø,an

6、d{}L=LforeachlanguageL.7closedAcollectionofobjectsisclosedundersomeoperationifapplyingthatoperationtomembersofthecollectionreturnsanobjectstillinthecollection.N={1,2,3…}isclosedundermultiplication,notclosedunderdivision.Thesetofintegers(positive,negative,andzero)isclosedundersubtraction.8finit

7、eautomataInputstring-Inputtape,dividedintocells(orcalledsquares),whichcaneachholdexactlyonesymbol.Readingheadmoveslefttoright,onesquareatatime.Initially:leftmostsquareInitialstateStatetranslateCurrentstate&symbolreadWindupinoneofF

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。