x
Free Video Lecturers
Menu
SignUp
Close
  1. Home
  2. All Courses
  4. IIT Kanpur

Theory of Computation

IIT Kanpur, , Prof. Prof. Raghunath Tewari

Updated On 02 Feb, 19

Overview

This is an introductory course on Theory of Computation intended for undergraduate students in computer science. In this course we will introduce various models of computation and study their power and limitations. We will also explore the properties of the corresponding language classes defined by these models and the relations between them. We will assume the student is comfortable in analytical reasoning and has preferably done a course on Data Structures and Algorithms.

Includes

Lecture 21: Pushdown Automata

4.1 ( 11 )

Lecture Details

Course Details

COURSE LAYOUT

Week 1: Finite Automata deterministic and nondeterministic, regular operations
Week 2: Regular Expression, Equivalence of DFA, NFA and REs, closure properties
Week 3: Non regular languages and pumping lemma, DFA Minimization, 
Week 4: CFGs, Chomsky Normal Form
Week 5: Non CFLs and pumping lemma for CFLs, PDAs,  Equivalence of PDA and CFG
Week 6: Properties of CFLs, DCFLs, Turing Machines and its variants
Week 7: Configuration graph, closure properties of decidable languages, decidability properties of regular languages and CFLs
Week 8: Undecidability, reductions, Rice's Theorem, introduction to complexity theory

Related Courses
Product
Mobius Function
Delivered by Other
FREE
15
Product
Optimization
Delivered by IIT Kharagpur
FREE
15
Product
udemy course agile crash course
Delivered by
FREE
15
Ratings

0


0 Ratings
55%
30%
10%
3%
2%
Comments
comment person image

Sam

Sep 12, 2018

Excellent course helped me understand topic that i couldn't while attendinfg my college.

Reply
comment person image

Dembe

March 29, 2019

Great course. Thank you very much.

Reply
Send