Theory of Automata and Formal Languages
- Full Playlist of All Lectures
- Introduction I
- Introduction II
- Introduction III
- Introduction IV
- Regular Languages & Regular Expressions & Finite Automata
- Finite Automata I
- Finite Automata II
- Finite Automata III
- Union, Intersection and Complement of FAs
- Non Deterministic Finite Automata (NFA)
- NFA-NULL: Union, Intersection, Kleen's Theorem
- Getting Regular Expression Using State Elimination Algorithm
- Equivalence of States
- Pumping Lemma
- Context Free Grammars
- CFG to Chomsky Normal Form ( CNF ) - Part I
- CFG to Chomsky Normal Form ( CNF ) - Part II
- CYK Algorithm
- Push Down Automaton ( PDA )
- Turing Machine ( TM )
Video Tutorials (Please Subscribe the Channel)
- Course Outline
- Lecture 1-2
- Lecture 3-4
- Lecture 5-6
- Lecture 7-8
- Home Work # 1 (Deadline Before Mid Term)
- Lecture 9-10
- Lecture 11-12
- Lecture 13-14
- Lecture 15-16
- Lecture 17-18
- Lecture 19-20
- Lecture 21-22
- Lecture 23-24
- Lecture 25-26
- Lecture 27-28
- Quiz # 1 (Regular)
- Quiz # 1 (Self Support)
- Mid Term (05/11/2018)
- Home Work # 2 (For Regular and Self Support Classes: Deadline Before the Final Term)
- Quiz # 2 (For Regular and Self Support Classes: Deadline Before the Final Term)