Theory of Computation

Welcome to the Theory of Computation course.

Course Activity

Sep 20

PDA and Parsing

Sep 13

CFG and CFL

Aug 26 Action Required

Assignment 4: Properties of Regular Languages +

Due: Sep 05, 2026

Important Announcements

Classes start from August 2026

Course Materials

Posted: Aug 26, 2026

Assignment 4: Properties of Regular Languages

Posted: Aug 21, 2026

Assignment 3: Regular Grammars

Posted: Aug 14, 2026

Assignment 2: Finite Automata

Posted: Aug 07, 2026

Assignment 1: Prerequisites

Posted: Sep 20, 2026

Pushdown Automata and Deterministic Parsing

Posted: Sep 13, 2026

Context-Free Languages and Grammars

Posted: Aug 17, 2026

Properties of Regular Languages

Posted: Aug 10, 2026

Regular Expressions and Regular Grammars

Posted: Aug 10, 2026

Finite Automata

Posted: Jul 17, 2026

Mathematical Foundations and Preliminaries

Class Details

Instructor: SDB, RNB, PBL

Schedule: Refer to Departmental Time-table

Venue: Refer to Departmental Time-table

Documents:

Course Syllabus

Core Texts:

[Textbook] Introduction to Automata, Theory, Languages and Computation. Third Edition. John Hopcroft, Rajeev Motwani, Jeffrey D. Ullmann, Pearson Publications
[Textbook] Peter Linz, An Introduction to Formal Languages and Automata, Narosa Pub. House, 2011
[Textbook] Introduction to the Theory of Computation, 3rd edition. Michael Sipser, Cengage Publications
[Reference] Automata and Computability, Dexter C. Kozen. Part of the Undergraduate Texts in Computer Science book series (UTCS) Springer
[Reference] Elements of the Theory of Computation, 2nd edition. Harry Lewis, Christos Papadimitriou, Prentice Hall
[Reference] Dr. R.B.Patel, Theory of Computation, Khanna Publishing House

Policy & Outcomes

Course Outcomes (CO)

CO1: Design finite automata and pushdown automata.
CO2: Understand regular and context-free languages.
CO3: Analyze the computational limits of Turing machines.

Grading Weightage

Mid-Term Examination: 30%
Final Examination: 50%
Assignments & Quizzes: 20%