Introduction to Formal Languages and Automata Theory

Lecture, four hours; discussion, two hours; outside study, six hours. Enforced requisite: course 180. Designed for junior/senior Computer Science majors. Grammars, automata, and languages. Finite-state languages and finite-state automata. Context-free languages and pushdown story automata. Unrestricted rewriting systems, recursively enumerable and recursive languages, and Turing machines. Closure properties, pumping lemmas, and decision algorithms. Introduction to computability. Letter grading.

Review Summary

Clarity
6.7 / 10
Organization
8.3 / 10
Time
5-10 hrs/week
Overall
8.3 / 10

Reviews

    Quarter Taken: Fall 2022 In-Person
    Grade: A

    Lectures covered many examples to cover the topics you needed to know in the exam. Tests were difficult but fair. I learned a lot of new content in this class.

Course

Instructor
Raghu Meka
Previously taught
22F 21F 20F

Grading Information

  • No group projects

  • Attendance not required

  • 1 midterm

  • Finals week final

  • 36% recommend the textbook

Previous Grades

Grade distributions not available.