Все публикации

0:32:33

More on the class NP

0:29:04

Introduction to Computational Complexity Theory

0:30:03

Rice's theorem

0:32:07

NP-Completeness

0:28:24

More on NP-Completeness

0:29:15

Decidability properties of Regular and Context Free Languages

0:32:38

Reduction

0:29:04

More on Undecidability

0:29:53

Undecidability

0:28:58

Applications of Reduction

0:29:35

Configuration Graphs

0:32:24

Closure Properties of Decidable and Turing recognizable languages

0:28:12

More on Turing Machine

0:30:53

Turing Machine

0:32:19

Non deterministic Turing Machine Edit Lesson

0:28:44

Pushdown Automata

0:29:10

Deterministic Context Free Languages

0:34:04

Pushdown Automata - Examples and Relation with CFGs

0:32:55

Pushdown Automata - Definition and Example

0:27:32

Closure Properties of CFLs

0:32:12

Examples of non- CFLs

0:31:38

Examples of CFGs, Reg subset of CFL

0:32:12

Parse tree, derivation, ambiguity

0:32:19

Normal forms, Chomsky normal form