Standard Videos for Theory of Computation

Question

$$\textbf{Contents}$$

$\textbf{Syllabus:}$

Web Page

• Regular expressions and finite automata.
• Context-free grammars and push-down automata.
• Regular and context-free languages, Pumping lemma.
• Turing machines and undecidability.

Topic Covered in Videos

Video link from GO Youtube channel

Introduction to TOC and Finite State Machines Closure & Non-determinism Pumping Lemma Minimizing Finite State Machines Context-free Grammars Relationship to Compiling & Chomsky Normal Forms Deterministic & Non-deterministic Pushdown Automata Context-Free Grammars (CFGs) and Push Down Automata (PDA) More Lemmas and CYK Algorithm Undecidability and CFLs The Bull's Eye Turing Machines The Halting Problem Decidability Complexity Theory; Quantified Boolean Formula Decidability discussion Part 1 Decidability discussion Part 2 Decidability discussion Part 3

GO Videos