30:03

Rice's theorem

29:04

Introduction to Computational Complexity Theory

32:33

More on the class NP

32:07

NP-Completeness

28:24

More on NP-Completeness

29:53

Undecidability

29:15

Decidability properties of Regular and Context Free Languages

29:04

More on Undecidability

32:38

Reduction

28:58

Applications of Reduction

30:53

Turing Machine

28:12

More on Turing Machine

32:19

Non deterministic Turing Machine Edit Lesson

29:35

Configuration Graphs

32:24

Closure Properties of Decidable and Turing recognizable languages

28:44

Pushdown Automata

29:10

Deterministic Context Free Languages

27:31

Closure Properties of CFLs

34:04

Pushdown Automata - Examples and Relation with CFGs

32:55

Pushdown Automata - Definition and Example

32:12

Examples of non- CFLs

31:38

Examples of CFGs, Reg subset of CFL

32:12

Parse tree, derivation, ambiguity

32:19

Normal forms, Chomsky normal form

26:36

Non-CFLs, pumping lemma

29:27

Introduction to CFGs

29:19

DFA minimization

32:16

Examples of non-regular languages

33:14

Equivalence of NFA and DFA, Closure properties

33:53

Regular expressions

25:18

Algebraic properties, RE to NFA conversion

33:34

GNFA to RE conversion

31:40

More closure properties of regular languages

28:05

Non-regular languages and pumping lemma

30:27

NFA, definition and examples

30:23

Introduction to Nondeterminism

30:52

Computation by DFA and Regular operation

32:17

Example of DFAs

26:24

Basic Notation and Convention, DFA Edit Lesson

29:44

Introduction to Finite Automata

02:22

Introduction - Theory of Computation - Prof. Raghunath Tewari