IIT Kanpur · Computer Science
Theory of Computation
Prof. Raghunath Tewari · 39 free video lectures
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…
▶ Play on Open Lecture HallCourse page ↗
Lectures
- Introduction to Finite Automata
- Basic Notation and Convention, DFA
- Example of DFAs
- Computation by DFA and Regular operation
- Introduction to Nondeterminism
- NFA, definition and examples
- Equivalence of NFA and DFA, Closure properties
- Regular expressions
- Algebraic properties, RE to NFA conversion
- GNFA to RE conversion
- More closure properties of regular languages
- Non-regular languages and pumping lemma
- Examples of non-regular languages
- DFA minimization
- Introduction to CFGs
- Examples of CFGs, Reg subset of CFL
- Parse tree, derivation, ambiguity
- Normal forms, Chomsky normal form
- Non-CFLs, pumping lemma
- Examples of non- CFLs
- Pushdown Automata
- Pushdown Automata - Definition and Example
- Pushdown Automata - Examples and Relation with CFGs
- Closure Properties of CFLs
- Deterministic Context Free Languages
- Turing Machine
- More on Turing Machine
- Non deterministic Turing Machine
- Configuration Graphs
- Decidability properties of Regular and Context Free Languages
- Undecidability
- More on Undecidability
- Reduction
- Applications of Reduction
- Rice's theorem
- Introduction to Computational Complexity Theory
- More on the class NP
- NP-Completeness
- More on NP-Completeness
From NPTEL (IITs and IISc) · CC BY-NC-SA. More from IIT Kanpur.
Open Lecture Hall is free, with no ads and no sign-up. It is not run by or connected to any university; the lectures are the universities' own free recordings, played from where they host them. About & rights