Skip to content Skip to navigation

Automata

Date: 
Monday, September 1, 2014 to Monday, October 13, 2014
Go to Course

About the Course

I am pleased to be able to offer free over the Internet a course on Automata Theory, based on the material I have taught periodically at Stanford in the course CS154. Course participants have access to screencast lecture videos, are given quiz questions, assignments and exams, receive regular feedback on progress, and can participate in a discussion forum. Those who successfully complete the course will receive a statement of accomplishment. You will need a decent Internet connection for accessing course materials, but should be able to watch the videos on your smartphone.

The course covers four broad areas: (1) Finite automata and regular expressions, (2) context-free grammars, (3) Turing machines and decidability, and (4) the theory of intractability, or NP-complete problems.

FAQ: 
  • Will I get a statement of accomplishment after completing this class?

    Yes. Participants who successfully complete the class will receive a statement of accomplishment signed by the instructor.

  • What is the format of the class?

    The course will consist of lecture videos, which are between 15 and 45 minutes in length. These contain integrated quiz questions. There will also be standalone homework in addition to video lectures, optional programming assignments, and a (not optional) final exam.

  • How much work will I be expected to do in this class?

    You need to work about 5-10 hours per week to complete the course. About 2 hours of video segments each week, containing inline ungraded quiz questions. A weekly, graded multiple choice homework.

Instructor(s): 
Jeff Ullman

View All Courses

Access learning material from upcoming, self-study, and completed courses...