|
所在平台: Udemy |
课程主页: https://www.udemy.com/course/theory-of-computation-automata-theory-for-2021/
课程评论：没有评论
课程名称：计算理论（TOC）/ 自动机：完整套餐 课程概述：本课程是“计算理论（TOC）”或“自动机理论”或“形式语言”的一站式学习平台。课程旨在从零开始进行全面的讨论，涵盖每个章节的深入理论分析，提供150多个问题的解决方案视频，确保疑问在24小时内得到解答，同时设有自我评估的测验和作业。 学习形式语言和自动机理论的原因在于，自动机理论为我们所称的计算机这一复杂机器提供了一个简单优雅的视角。相较于技术、开发和计算机系统管理的不断变化，自动机理论具有高度的持久性和稳定性。此外，自动机理论的部分内容直接与实际应用相关，例如电路设计、编译器设计和搜索算法，形式语言和文法对编译器设计的影响，以及复杂性在密码学、制造、商业和管理优化问题中的作用。最后，研究导向的学生能在此课程中充分利用所学的自动机理论。 课程目标包括：理解机器的概念（有限自动机、下推自动机、线性有界自动机和图灵机），理解形式语言和文法（正规文法和正规语言、上下文无关语言和上下文无关文法；以及上下文相关语言和无约束文法的介绍），理解这些形式语言、文法与机器之间的关系，理解通过这些机器解决问题的复杂性或难易水平，理解算法的概念，以及比较问题的复杂性。 适合人群：该课程适合所有人，包括学术学生、面试准备者、竞争考试准备者，以及对计算理论/自动机理论感兴趣的任何人。
_______________________________________________________________**** Visit my website for better offers in instructor profile. ****-------------------------------------One stop destination for "Theory of Computation(TOC)" or "Automata Theory" or "Formal Languages". Features: Complete end to end discussion from scratch.Thorough theory discussion for every chapter.150+ problems solved with video solutions.Doubts clarifications can be done with in 24 hours.Quizzes and Assignments for self assessment. COURSE OVERVIEW: Formal languages and automata theory deals with the concepts of automata, formal languages, grammar, computability and decidability. The reasons to study Formal Languages and Automata Theory are Automata Theory provides a simple, elegant view of the complex machine that we call a computer. Automata Theory possesses a high degree of permanence and stability, in contrast with the ever-changing paradigms of the technology, development, and management of computer systems. Further, parts of the Automata theory have direct bearing on practice, such as Automata on circuit design, compiler design, and search algorithms; Formal Languages and Grammars oncompiler design; and Complexity on cryptography and optimization problems in manufacturing, business, and management. Last, but not least, research oriented students will make good use of the Automata theory studied in this course.Course Objectives:To understand the concept of machines: finite automata, pushdown automata, linear bounded automata, and Turing machines.To understand the formal languages and grammars: regular grammar and regular languages, context-free languages and context-free grammar; and introduction to context-sensitive language and context-free grammar, and unrestricted grammar and languages.To understand the relation between these formal languages, grammars, and machines.To understand the complexity or difficulty level of problems when solved using these machines.To understand the concept of algorithm.To compare the complexity of problems.Who this course is for:For everyoneAcademic Students.Interview Preparation Persons.Competitive Exam Preparation Aspirants.Anyone interested in Theory of computation/ Automata Theory.
