清华大学计算导论英文版introduction to the theory of computation

清华大学计算导论英文版introduction to the theory of computation

ID:33838126

大小:84.29 KB

页数:13页

时间:2019-02-28

清华大学计算导论英文版introduction to the theory of computation_第1页
清华大学计算导论英文版introduction to the theory of computation_第2页
清华大学计算导论英文版introduction to the theory of computation_第3页
清华大学计算导论英文版introduction to the theory of computation_第4页
清华大学计算导论英文版introduction to the theory of computation_第5页
资源描述:

《清华大学计算导论英文版introduction to the theory of computation》由会员上传分享,免费在线阅读,更多相关内容在教育资源-天天文库

1、IntroductiontotheTheoryofComputation,MichaelSipserChapter0:IntroductionAutomata,ComputabilityandComplexity:·Theyarelinkedbythequestion:o“Whatarethefundamentalcapabilitiesandlimitationsofcomputers?”·Thetheoriesofcomputabilityandcomplexityarecloselyrelated.Incomplexitytheory,the

2、objectiveistoclassifyproblemsaseasyonesandhardones,whereasincomputabilitytheoryheclassificationofproblemsisbythosethataresolvableandthosethatarenot.Computabilitytheoryintroducesseveraloftheconceptsusedincomplexitytheory.·Automatatheorydealswiththedefinitionsandpropertiesofmath

3、ematicalmodelsofcomputation.·Onemodel,calledthefiniteautomaton,isusedintextprocessing,compilers,andhardwaredesign.Anothermodel,calledthecontext–freegrammar,isusedinprogramminglanguagesandartificialintelligence.StringsandLanguages:·Thestringofthelengthzeroiscalledtheemptystring

4、andiswrittenase.·Alanguageisasetofstrings.Definitions,TheoremsandProofs:·Definitionsdescribetheobjectsandnotionsthatweuse.·Aproofisaconvincinglogicalargumentthatastatementistrue.·Atheoremisamathematicalstatementprovedtrue.·Occasionallyweprovestatementsthatareinterestingonlybec

5、ausetheyassistintheproofofanother,moresignificantstatement.Suchstatementsarecalledlemmas.·Occasionallyatheoremoritsproofmayallowustoconcludeeasilythatother,relatedstatementsaretrue.Thesestatementsarecalledcorollariesofthetheorem.Chapter1:RegularLanguagesIntroduction:·Anidealiz

6、edcomputeriscalleda“computationalmodel”whichallowsustosetupamanageablemathematicaltheoryofitdirectly.·Aswithanymodelinscience,acomputationalmodelmaybeaccurateinsomewaysbutperhapsnotinothers.·Thesimplestmodeliscalled“finitestatemachine”or“finiteautomaton”.FiniteAutomata:·Finite

7、Automataaregoodmodelsforcomputerswithanextremelylimitedamountofmemory,likeforexampleanautomaticdoor,elevatorordigitalwatches.·Finiteautomataandtheirprobabilisticcounterpart“Markovchains”areusefultoolswhenweareattemptingtorecognizepatternsindata.Thesedevicesareusedinspeechproce

8、ssingandinopticalcharacterrecognition.Markovchainshaveevenbee

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

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

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