ppt for 1 course outline and motivationPPT 1课程大纲与动机.ppt

下载文档 降价啦

3
0
约1.28万字
约 11页
2018-06-27 发布于福建
举报
版权申诉
保障服务

ppt for 1 course outline and motivationPPT 1课程大纲与动机.ppt

1、本文档共11页，可阅读全部内容。
2、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。

ppt for 1 course outline and motivationPPT 1课程大纲与动机

Welcome to the Stanford Automata Theory Course Why Study Automata? What the Course is About Why Study Automata? A survey of Stanford grads 5 years out asked which of their courses did they use in their job. Basics like intro-programming took the top spots, of course. But among optional courses, CS154 stood remarkably high. 3X the score for AI, for example. How Could That Be? Regular expressions are used in many systems. E.g., UNIX a.*b. E.g., DTD’s describe XML tags with a RE format like person (name, addr, child*). Finite automata model protocols, electronic circuits. How? – (2) Context-free grammars are used to describe the syntax of essentially every programming language. Not to forget their important role in describing natural languages. And DTD’s taken as a whole, are really CFG’s. How? – (3) When developing solutions to real problems, we often confront the limitations of what software can do. Undecidable things – no program whatever can do it. Intractable things – there are programs, but no fast programs. Automata theory gives you the tools. Other Good Stuff We’ll learn how to deal formally with discrete systems. Proofs: You never really prove a program correct, but you need to be thinking of why a tricky technique really works. We’ll gain experience with abstract models and constructions. Models layered software architectures. Automata Theory – Gateway Drug This theory has attracted people of a mathematical bent to CS, to the betterment of all. Ken Thompson – before UNIX was working on compiling regular expressions. Jim Gray – thesis was automata theory before he got into database systems and made fundamental contributions there. Course Outline Regular Languages and their descriptors: Finite automata, nondeterministic finite automata, regular expressions. Algorithms to decide questions about regular languages, e.g., is it empty? Closure properties of regular languages. Course Outline – (2) Context-free languages and their descriptors: Context-free grammars