IIT Guwahati · Mathematics & Statistics
Formal Languages and Automata Theory
Dr. Diganta Goswami, Dr. K.V. Krishna · 41 free video lectures
41 video lectures. Topics: Introduction; Alphabet, Strings, Languages; Finite Representation; Grammars (CFG); Derivation Trees; Regular Grammars; Finite Automata; Nondeterministic Finite Automata; NFA DFA; Myhill-Nerode Theorem; Minimization; RE => FA; FA => RE; FA RG; Variants of FA; Closure…
▶ Play on Open Lecture HallCourse page ↗
Lectures
- Introduction
- Alphabet, Strings, Languages
- Finite Representation
- Grammars (CFG)
- Derivation Trees
- Regular Grammars
- Finite Automata
- Nondeterministic Finite Automata
- NFA DFA
- Myhill-Nerode Theorem
- Minimization
- RE => FA
- FA => RE
- FA RG
- Variants of FA
- Closure Properties of RL
- Homomorphism
- Pumping Lemma
- Simplification of CFG
- Normal Forms of CFG
- Properties of CFLs
- Pushdown Automata
- PDA CFG
- Turing Machines
- Turing Computable Functions
- Combining Turing Machines
- Multi Input
- Turing Decidable Languages
- Varients of Turing Machines
- Structured Grammars
- Decidability
- Undecidability1
- Undecidability2
- Undecidability3
- Time Bounded Turing Machines
- P and NP
- NP-Completeness
- NP-Complete Problems1
- NP-Complete Problems2
- NP-Complete Problems3
- Chomsky Hierarchy
From NPTEL (IITs and IISc) · CC BY-NC-SA. More from IIT Guwahati.
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