- From www.edx.org
Automata Theory
- Self-paced
- Free Access
- Fee-based Certificate
- 7 Sequences
- Advanced Level
Course details
Syllabus
- Finite automata and regular expressions
- Context-free grammars
- Turing machines and decidability
- The theory of intractability, or NP-complete problems
Prerequisite
The primary prerequisite for this course is reasonable "mathematical sophistication." That is, you should feel comfortable with mathematics and proofs. Specific topics that are useful include a knowledge of graphs, trees, and logic, as well as basic data structures and algorithms.
It is intended for students who have had at least 2 years of Computer-Science courses, including discrete mathematics (graphs, trees, logic, proofs, etc.) and an introduction to data structures and algorithms.
Instructors
Jeffrey D. Ullman
Professor of Engineering, Emeritus
Stanford University
Platform
Harvard University, the Massachusetts Institute of Technology, and the University of California, Berkeley, are just some of the schools that you have at your fingertips with EdX. Through massive open online courses (MOOCs) from the world's best universities, you can develop your knowledge in literature, math, history, food and nutrition, and more. These online classes are taught by highly-regarded experts in the field. If you take a class on computer science through Harvard, you may be taught by David J. Malan, a senior lecturer on computer science at Harvard University for the School of Engineering and Applied Sciences. But there's not just one professor - you have access to the entire teaching staff, allowing you to receive feedback on assignments straight from the experts. Pursue a Verified Certificate to document your achievements and use your coursework for job and school applications, promotions, and more. EdX also works with top universities to conduct research, allowing them to learn more about learning. Using their findings, edX is able to provide students with the best and most effective courses, constantly enhancing the student experience.