Theory of Computation (Hindi) (Part 1)

   Sunday, May 05, 2024   

Starting a new Lecture Notes Series on Theory of Computation

Youtube Lecture Playlist Credits 

Channel Name: THE GATEHUB

So Let Us Start to This Journey of Learning 

Theory of Computation By Lecture Notes together!

Lecture 1: Introduction to Theory of Computation || GATECSE || TOC

Lecture 2: Power's of Alphabet Σ (Sigma) | GATECSE | TOC

Lecture 3: Introduction to DFA | Deterministic Finite Automata | TOC | Automata Theory

Lecture 4: Design DFA (length of the string is exactly 2 | at least 2 | at most 2) Example 1 | GATECSE | TOC

Lecture 5: DFA (Number of a in string is exactly 2 | at least 2 | at most 2) Example 2 | TOC | Automata Theory

Lecture 6: Design DFA in which number of a in w is divisible by 2 | number of a in w is even | Na(W) mod 2 = 0

Lecture 7: Design DFA in which number of a's and b's both are even | Na(W) mod 2 = 0 and Nb(W) mod 2 = 0| TOC

Lecture 8: Design DFA in which no of a's is multiple of 3 and no of b's is multiple of 2 | TOC | Automata

Lecture 9: Design DFA in which no of a's is multiple of 3 or no of b's is multiple of 2 | TOC | Automata

Lecture 10: Design DFA binary number divisible by 2 | TOC | GATECS | Automata Theory

Lecture 11: Design DFA binary number divisible by 3 and divisible by 4 | GATECS | TOC | Automata Theory

Lecture 12: Design a DFA in which set of all strings can be accepted which start with ab | TOC | Automata Theory

Lecture 13: DFA that accepts strings containing "ab" as a substring | DFA Design| TOC | Automata Theory

Lecture 14: Design a DFA in which set of all strings can be accepted which ends with ab | TOC | Automata Theory

Lecture 15: DFA of language with all strings starting with 'a' and ending with 'b' | TOC | GATECS

Lecture 16: DFA that accepts strings containing "ab" as a substring | DFA Design| TOC | Automata Theory

Lecture 17: Design a DFA in which set of all strings can be accepted which ends with ab | TOC | Automata Theory

Lecture 18: DFA of language with all strings starting with 'a' and ending with 'b' | TOC | GATECS

Lecture 19: Design DFA in which accepts set of all strings, Second symbol from LHS is a and fifth symbol is b

Lecture 20: Design DFA for L= a^n / n is greater than or equal to 0 , n is not =2, n is not =4 | TOC | Automata

Lecture 21: Design DFA for L= a^m b^n / n is greater than or equal to 0 | DFA Design | TOC | Automata

Lecture 22: Design DFA for L= a^m b^n c^p / m,n,p is greater than or equal to 0 | DFA Design | TOC | Automata

Lecture 23: DFA which accepts strings of form a^3bwa^3 , where 'w' is any string| DFA design |TOC | Automata

Lecture 24: Design DFA for strings that every a is immediately preceded and followed by b | GATECSE | TOC

Lecture 25: Introduction to NFA | Non Deterministic Finite Automata | TOC

Lecture 26: NFA to DFA Conversion Example 1 | Conversion from NFA to DFA Examples | TOC | Automata Theory

Lecture 27: NFA to DFA Conversion Example 2 | Conversion from NFA to DFA Examples | TOC | Automata Theory

Lecture 28: NFA to DFA Conversion Example 3 | Conversion from NFA to DFA Examples | TOC | Automata Theory

Lecture 29: Epsilon NFA to DFA Example 1 | epsilon NFA to DFA | TOC | Automata Theory

Lecture 30: Epsilon NFA to DFA Example 2 | Conversion of Epsilon NFA to DFA | GATECS | TOC

Lecture 31: Introduction to Regular Expression | Regular Language to Regular Expression | Automata Theory

Lecture 32: Regular Expression Solved Examples | Regular language to Regular Expression | GATECSE | TOC

Lecture 33: Regular Expression Solved Examples | Regular language to Regular Expression | GATECSE | TOC

Lecture 34: Regular Expression Solved Examples | Regular language to Regular Expression | GATECSE | TOC

Lecture 35: Regular Expression Solved Examples | Regular language to Regular Expression | GATECSE | TOC

Lecture 36: Arden’s Theorem | Finite Automata to Regular Expression | GATECSE | TOC

Lecture 37: Arden's Theorem Example 1 | Finite Automata to Regular Expression | GATECSE | TOC

Lecture 38: Arden's Theorem Examples 2 | Finite Automata to Regular Expression | GATECSE | TOC

Lecture 39: Arden's Theorem Examples 3 | Finite Automata to Regular Expression | GATECSE | TOC

Lecture 40: Arden's Theorem Example 4 | Finite Automata to Regular Expression | TOC

Lecture 41: Finite Automata to Regular Expression using State Elimination Method | GATECS | TOC

Lecture 42: Finite Automata to Regular Expression using State Elimination Method | GATECS | TOC

Lecture 43: Finite Automata to Regular Expression using State Elimination Method | GATECS | TOC

Lecture 44: Finite Automata to Regular Expression using State Elimination Method | GATECS | TOC

Lecture 45: Introduction to Mealy and Moore Machine | TOC | GATECSE

Lecture 46: Design Mealy Machine for 1's and 2's Complement | TOC | GATECSE

Lecture 47: Design Moore Machine for print 1 for every occurrence of ab as a substring | TOC

Lecture 48: Conversion from Moore Machine to Mealy Machine || Example 1 || GATECSE || TOC

Lecture 49: Conversion from Moore Machine to Mealy Machine || Example 2 || GATECSE || TOC

Lecture 50: Conversion from Mealy Machine to Moore Machine || Example 1 || GATECSE || TOC

Lecture 51: Conversion from Mealy Machine to Moore Machine || Example 2 || GATECSE || TOC

Lecture 52: DFA Minimization || Example 1 || Minimization of DFA || GATE CSE || TOC

Lecture 53: DFA Minimization || Example 2 || Minimization of DFA || GATE CSE || TOC

Lecture 54: DFA Minimization || Example 3 || Minimization of DFA || GATE CSE || TOC

Lecture 55: DFA Minimization || Example 4 || Minimization of DFA || GATE CSE || TOC

Lecture 56: What is Grammar in TOC || GATECSE || TOC

Lecture 57: Chomsky Classification of Grammar || GATECSE || TOC

Lecture 58: Conversion from Language to Grammar || GATECSE || TOC

Lecture 59: Conversion from Right Linear Grammar to Left Linear Grammar || Regular Grammar || TOC

Lecture 60: How to identify Regular Language | Testing whether a language is regular or not | GATECSE | TOC