TOC | TAFL | Automata | Theory Of Computation | Theory of Automata |Theory of Automata and Formal Languages| Aktu tafl (Hindi) (Part 2)

   Thursday, July 17, 2025   

Starting a new Lecture Notes Series on TOC | TAFL | Automata | Theory Of Computation | Theory of Automata |Theory of Automata and Formal Languages| Aktu tafl

Youtube Lecture Playlist Credits 

Channel Name: FISTS Academy

So Let Us Start to This Journey of Learning 

TOC | TAFL | Automata | Theory Of Computation | Theory of Automata |Theory of Automata and Formal Languages| Aktu tafl By Lecture Notes together!

Lecture 52: Lec 51 | Regular Language | @fistsAcademy

Lecture 53: Lec 52 | Closure Properties of Regular Languages | Regular Language | @fistsAcademy

Lecture 54: Lec 53 | Homomorphism Closure Property of Regular Language | @fistsAcademy

Lecture 55: Lec 54 | Pumping Lemma with EX-1 | @fistsAcademy

Lecture 56: Lec 55 | Pumping Lemma Ex-2 | Regular Language | @fistsAcademy

Lecture 57: Lec 56 | Pumping Lemma Ex-3 | Regular Language | @fistsAcademy

Lecture 58: Lec 57 | Grammar | Grammar to Language | @fistsAcademy

Lecture 59: Lec 58 | Grammar to Language Examples | @fistsAcademy

Lecture 60: Lec 59 | Language to Grammar Ex-1 | @fistsAcademy

Lecture 61: Lec 60 | Language to Grammar Ex-2 | @fistsAcademy

Lecture 62: Lec 61 | Context Free Grammar | Type 2 Grammar | @fistsAcademy

Lecture 63: Lec 62 | Ambiguous Grammar | Grammar | @fistsAcademy

Lecture 64: Lec 63 | Simplification of Context Free Grammar | Context Free Grammar | @fistsAcademy

Lecture 65: Lec 64 | CFG Normal Forms | Context Free Grammar | @fistsAcademy

Lecture 66: Lec 65 | CFG to CNF Conversion Ex-1 | Context Free Grammar | @fistsAcademy

Lecture 67: Lec 66 | CFG to CNF Conversion Ex-2 | Context Free Grammar | @fistsAcademy

Lecture 68: Lec 67 | CFG to GNF (Greibach Normal Form) Conversion | Context Free Grammar | @fistsAcademy

Lecture 69: Lec 68 | Push Down Automata (PDA) | @fistsAcademy

Lecture 70: Lec 69 | Push Down Automata Ex-1 | PDA | @fistsAcademy

Lecture 71: Lec 70 | Push Down Automata Ex-2 | PDA | @fistsAcademy

Lecture 72: Lec 71 | Push Down Automata Ex-3 | PDA | @fistsAcademy

Lecture 73: Lec 72 | Push Down Automata Ex-4 | PDA | @fistsAcademy

Lecture 74: Lec 73 | Push Down Automata Ex-5 | PDA | @fistsAcademy

Lecture 75: Lec 74 | Instantaneous Description (ID) of PDA | Push Down Automata | @fistsAcademy

Lecture 76: Lec 75 | Push Down Automata Ex-6 | PDA | @fistsAcademy

Lecture 77: Lec 76 | Push Down Automata Ex-7 | PDA | @fistsAcademy

Lecture 78: Lec 77 | Push Down Automata Ex-8 | PDA | @fistsAcademy

Lecture 79: Lec 78 | PDA to CFG Conversion Ex -1 | Push Down Automata | @fistsAcademy

Lecture 80: Lec 79 | PDA to CFG Conversion Ex -2 | Push Down Automata | @fistsAcademy

Lecture 81: Lec 80 | CFG to PDA Conversion Ex-1 | Push Down Automata | @fistsAcademy

Lecture 82: Lec 81 | Two Stack PDA | Overview & Ex-1 | Push Down Automata | @fistsAcademy

Lecture 83: Lec 82 | 2 Stack PDA Ex-2 | Push Down Automata | @fistsAcademy

Lecture 84: Lec 83 | Turing Machine | @fistsAcademy

Lecture 85: Lec 84 | Instantaneous Description (ID) of TM | Turing Machine | @fistsAcademy

Lecture 86: Lec 85 | Turing Machine Ex-1 | Turing Machine | @fistsAcademy

Lecture 87: Lec 86 | Turing Machine Ex-2 | Turing Machine | @fistsAcademy

Lecture 88: Lec 87 | Post Correspondence Problem | Turing Machine | @fistsAcademy

Lecture 89: Lec 88 | Church Turing Thesis | Universal Turing Machine (UTM) | Turing Machine | @fistsAcademy

Lecture 90: Lec 89 | Recursive & Recursive Enumerable Language | Turing Machine | @fistsAcademy

Lecture 91: Lec 90 | Properties of Recursive & Recursive Enumerable Language | Turing Machine | @fistsAcademy

Lecture 92: Lec- 91|Variants of Turing Machine -1|Multi-tape Turing Machine|Offline Turing Machine|@fistsAcademy

Lecture 93: Lec 92|Variants of Turing Machine -2|Multi-Dimensional|Multi-Track|Non-Deterministic |@fistsAcademy​

Lecture 94: Lec 93 | Linear Bounded Automata (LBA) | @fistsAcademy

Lecture 95: Lec 94 | Halting Problem of Turing Machine | Turing Machine | @fistsAcademy

Lecture 96: Lec 95 | Turing Machine Ex-3 | TM for Palindromes of a's and b's of any length | @fistsAcademy

Lecture 97: Lec 96 | Turing Machine Ex-4 | TM for Language of strings with same 1st & 2nd half | @fistsAcademy