计算理论-图灵机课件.ppt

计算理论-图灵机课件.ppt

ID:57034608

大小:144.50 KB

页数:33页

时间:2020-07-27

计算理论-图灵机课件.ppt_第1页
计算理论-图灵机课件.ppt_第2页
计算理论-图灵机课件.ppt_第3页
计算理论-图灵机课件.ppt_第4页
计算理论-图灵机课件.ppt_第5页
资源描述:

《计算理论-图灵机课件.ppt》由会员上传分享,免费在线阅读,更多相关内容在教育资源-天天文库

1、TheoryofComputationAutomatatheory andformallanguagesYouliQuBeijingJiaotongUniversityWhatisautomatatheoryAutomatatheoryisthestudyofabstractcomputationaldevicesAbstractdevicesare(simplified)modelsofrealcomputationsComputationshappeneverywhere:Onyourlaptop,onyourcellphone,innature,…Whydoweneedabs

2、tractmodels?AsimplecomputerBATTERYSWITCHinput:switchoutput:lightbulbactions:flipswitchstates:on,offAsimple“computer”BATTERYSWITCHoffonstartffinput:switchoutput:lightbulbactions:ffor“flipswitch”states:on,offbulbisonifandonlyiftherewasanoddnumberofflipsAnother“computer”BATTERYoffoffstart1inputs:

3、switches1and2actions:1for“flipswitch1”actions:2for“flipswitch2”states:on,offbulbisonifandonlyifbothswitcheswereflippedanoddnumberoftimes121offon112222AdesignproblemCanyoudesignacircuitwherethelightisonifandonlyifalltheswitcheswereflippedexactlythesamenumberoftimes?4BATTERY1235?AdesignproblemSu

4、chdevicesaredifficulttoreasonabout,becausetheycanbedesignedinaninfinitenumberofwaysByrepresentingthemasabstractcomputationaldevices,orautomata,wewilllearnhowtoanswersuchquestionsThesedevicescanmodelmanythingsTheycandescribetheoperationofany“smallcomputer”,likethecontrolcomponentofanalarmclocko

5、ramicrowaveTheyarealsousedinlexicalanalyzerstorecognizewellformedexpressionsinprogramminglanguages:ab1isalegalnameofavariableinC5u=isnotDifferentkindsofautomataThiswasonlyoneexampleofacomputationaldevice,andthereareothersWewilllookatdifferentdevices,andlookatthefollowingquestions:Whatcanagiven

6、typeofdevicecompute,andwhatareitslimitations?Isonetypeofdevicemorepowerfulthananother?SomedeviceswewillseefiniteautomataDeviceswithafiniteamountofmemory. Usedtomodel“small”computers.push-downautomataDeviceswithinfinitememorythatcanbeaccessedinarestrictedway.Usedtomodelparsers,etc.TuringMachine

7、sDeviceswithinfinitememory.Usedtomodelanycomputer.time-boundedTuringMachinesInfinitememory,butboundedrunningtime.Usedtomodelanycomputerprogramthatrunsina“reasonable”amountoftime.SomehighlightsofthecourseFiniteautomataWewillunderstandwha

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

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

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