1. To support our site, MoocLab may be compensated by some course providers through affiliate links.
  2. This course is part of the Upper Level Computer Science course program in the Computer Science Degree Path
    Click here to see all Upper Level Computer Science courses

    Dismiss Notice

Automata Theory

By Stanford University

  • Overview
  1. MoocLab
    COURSE DESCRIPTION
    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.

    Length: 6 Weeks
    Effort: 8-10 hours per week
    Price: FREE
    Provider: Stanford University
    Subject: Computer Science
    Level: Intermediate
    Languages: English
    Instructors: Jeffrey Ullman

Share This Page



  1. This site uses cookies to help personalise content, tailor your experience and to keep you logged in if you register.
    By continuing to use this site, you are consenting to our use of cookies.
    Dismiss Notice