|
所在平台: Udemy |
课程主页: https://www.udemy.com/course/theory-of-automata-and-computation/
课程评论：没有评论
**课程名称：** 自动机与计算理论 **课程概述：** 这是一门全面、深入且条理清晰的自动机与计算理论课程。无论您是计算机科学的初学者，已掌握形式语言和机器理论模型的基础，还是希望深入学习自动机与计算理论的进阶知识，本课程都将是您的理想选择。课程以简单互动的方式讲解自动机理论，包含超过25个讲座，共计3.5小时的视频内容，力求覆盖所有细节。课程在主要章节后设有测验，有助于您为课程考试或各类竞赛做好准备。每个主题都配以丰富详实的示例，确保概念的清晰理解。 **课程涵盖内容：** * 自动机理论简介及学习意义 * 语言及其基本构成要素 * 形式语言与非形式语言 * 语言的定义：描述性定义与递归定义 * 正则表达式：概念与构造方法 * 有限自动机及其两种类型：DFA 和 NFA * 转移图 * 正则语言与非正则语言 * 上下文无关语言与上下文无关文法 * 下推自动机 (PDA) * 图灵机 * 可判定性与不可判定性：可判定语言、部分可判定语言和不可判定语言
This is the most compendious and extensive, yet very straight forward course on the Theory of Automata and Computation. Whether you are a beginner in Computer Sciences , already know basics of Formal languages and theoretical models for machines or want to learn the advanced traits in the Theory of Automata and Computation, then this course is for you. In this course, I will teach you the Theory of Automata in a very simple and interactive manner.With over 25 lectures that comprise of three and half hours of video lectures, we have tried not to leave any minor detail without explaining it. This course includes quizzes at the end of major sections which will help you in your course exams or other competitive exams. Each and every topic has been covered with ample and elaborate examples to make your concepts precisely clear. In this course on Theory of Automata we cover wide range of topics, including:Introduction to the Theory of Automata and why we study it?Language and its fundamental building blocksFormal Languages and Informal LanguagesDefining a Language i.e Descriptive Definition and Recursive Definition of a LanguageRegular Expression i.e. what is it? and how to make it?Finite Automata and its two types i.e. DFA and NFA Transition GraphRegular VS Non-Regular LanguagesContext Free Languages and Context free GrammarsPushdown Automata (PDA)Turing MachineDecidability and Undecidability i.e. Decidable, Partially decidable, and undecidable languages
