Automata Theory (CS302.1) - Monsoon Semester 2021


This is a core undergraduate course on Automata Theory for computer science students. The topics covered in this course include Finite State Machines, Deterministic and Non-Deterministic Finite Automata, Regular Languages, Pumping Lemma, Context-Free Grammars, Ambiguity, Chomsky Normal Form, Pushdown Automata, Turing Machines, Recursive and Recursively Enumerable languages, Halting Problem and Undecidability.

The pre-requisites for the course are minimal - some familiarity with data structures and formal logic would suffice.


Course Format: 

The lectures and the tutorial sessions will be held online via MS Teams


Schedule: 


Evaluation:


There will be two theory assignments (20% weightage) and one programming assignment (25% weightage). There will be two proctored exams: one quiz (20% weightage) and one final exam (35% weightage).



Teaching Associates:



Lecture slides:

Lecture 1 | Lecture 2 | Lecture 3 | Lecture 4 | Lecture 5 | Lecture 6 | Lecture 7 | Lecture 8 | Lecture 9 | Lecture 10 | Lecture 11 | Lecture 12.


Assignments:


Quiz


Final Exam

The Final Exam will be held on Dec 04, 2021 from 8:30 AM - 10:00 AM. Please follow the instructions provided to you by the respective TAs. 


References