Virtual course of:edX |
This course covers the theory of automata and languages. We begin with a study of finite automata and the languages they can define (so-called "regular languages"). Topics include deterministic and non-deterministic automata, regular expressions, and the equivalence of these language-defining mechanisms.
Finite automata and regular expressions Grammars without context Turing machines and decision capacity The theory of intractability, or NP-complete problems Minimizing what you will learn
of students from all over the world are educated on the e-learning platform.
The Massachusetts Institute of Technology MIT and Harvard University launch edX in 2012.
The most prestigious universities and leading companies in the world offer their courses on edX.
2019 QS Reimagine Education Award Winner
in the employability category
Professor of Engineering, Emeritus
Stanford University
Hello how can I help you? Are you interested in a course? About what subject?
Add a review