TOC(Theory of Computation)

Watch and track your favorite playlist.

Curated by: Gate Smashers (69 videos)

---

Tracks in this Playlist

• Lec-1: Syllabus of TOC(Theory of Computation) for GATE | UGC NTA NET | Imp Points
• Lec-2: Introduction to TOC | What is Language in TOC with Examples in Hindi
• Lec-3: What is Automata in TOC | Theory of Computation
• Lec-4: Power of Sigma Σ in TOC | Kleene closure in TOC
• Lec-5: What is Grammar in TOC | Must Watch
• Lec-6: What is DFA in TOC with examples in hindi
• Lec-7: DFA Example 1 | How to Construct DFA in TOC
• Lec-8: DFA Example 2 | DFA of language with all strings end with 'a'
• Lec-9 : DFA of language with all strings starting with 'a' & ending with 'b' | DFA Example
• Lec-10: DFA of language with all strings Not starting with 'a' OR Not ending with 'b' | DFA Example
• Lec-11: DFA of all binary strings divisible by 3 | DFA Example 5
• Lec-12: DFA of all strings in which 2nd symbol is '0' and 4th symbol is '1' | DFA Example 6
• Lec-13: DFA for Even a and Even b | Even a Odd b | Odd a and Even b | Odd a Odd b | TOC
• lec-14 : Equivalence of DFA with examples
• Lec-15: Minimization of DFA in Hindi with example | TOC
• Lec-16: Limitations of DFA and Applications of DFA in TOC in Hindi
• Lec-17: What is NFA in TOC in Hindi | Non Deterministic Finite Automata
• Lec-18: Design NFA of all binary strings in which 2nd last bit is 1 | NFA Designing | TOC in Hindi
• Lec-19: DFA vs NFA in TOC in Hindi with examples | Must Watch
• Lec-20: Convert NFA to DFA with example in Hindi | How to Convert NFA to DFA
• Lec-21: Epsilon NFA in hindi | ε-NFA Formal Definition
• Lec-22: Eliminate Epsilon ε-moves | Conversion from epsilon nfa to nfa
• Lec-23: Conversion from Epsilon ε-NFA to DFA with example | Eliminate Epsilon ε-moves
• Lec-24: Moore Machine in TOC with example | What is Moore Machine in Hindi
• Lec-25: Mealy Machine in TOC | Formal Definition | Mealy Machine in Hindi
• Lec-26: Difference between Mealy and Moore Machine in Hindi | All imp points
• Lec-27: Moore to Mealy Conversion with example in Hindi | TOC
• Lec-28: Mealy to Moore Conversion with Example in Hindi
• Lec-29: Regular Expressions in TOC with examples | Formal Definition
• Lec-30: Regular Expressions for Finite Languages Example 1 | TOC
• Lec-31: Regular Expressions for Infinite Languages Example 2 | TOC
• Lec-32: Important Question on Regular Expressions for all Competitive Exams | TOC
• Lec-33: Pumping lemma for regular languages in TOC with examples
• Lec-34: Closure properties of regular languages in TOC
• Lec-35: Quotient operation in toc with example | Closure Properties
• Lec-36: Reversal Operation in toc | How regular languages closured under reversal
• Lec-37: INIT Operation in TOC
• Lec-38: Regular languages Not Closed under Infinite Union | TOC
• Lec-39: Closure Properties Of Various Languages in TOC | Theory Of Computation
• Lec-40: Languages, Automata, Grammars in TOC | Comparison between them
• Lec-41: Homomorphism in Regular Languages | closure Properties | TOC
• Lec-42: Inverse Homomorphism in Regular Languages | Closure Properties in TOC
• Lec-43: CFL and CFG Introduction and Syllabus discussion
• Lec-44: Closure Properties of CFL (Context Free Languages) with explanation in Hindi
• Lec-45: Question on DCFL and CFL in toc
• Lec-46: What is Context free grammar in TOC | Formal Definition
• Lec-47: Convert Context free language to Context free grammar with examples | TOC
• Lec-48: Derivation Tree 🌲Parse Tree 🌲 with example in TOC & Compiler design
• Lec-49: Left Most & Right Most Derivation in CFG | TOC
• Lec-37: Ambiguous vs Unambiguous Grammar with examples | Conversion Ambiguous ➡️ Unambiguous
• Lec-50: Recursive vs Non-Recursive CFG with examples | Classification of CFG
• Lec-51: Remove Unit Production from CFG(Context Free Grammar) in Hindi
• Lec-52: Remove Null Production from CFG (Context Free Grammar) with example in Hindi
• Lec-53: CYK Algorithm | Membership Algorithm in CFG | TOC
• Lec-54: CNF Vs GNF | Chomsky vs Greibach Normal Form | CFG in TOC
• Lec-55: What is Pushdown Automata in TOC | Definition & Explanation in Hindi
• Lec-56: Design PDA for 0^n1^2n CFL Language | Very Important| Must Watch
• Lec-57: Design PDA for {w | na(w) = nb(w)} CFL language | Pushdown automata | TOC
• Lec-58: What is LBA(Linear Bounded Automata) | All Points Covered | Theory of Automata
• Lec-59: Introduction to Turing Machine and its Definition in Hindi | TOC
• Lec-60: Turing Machine for a^nb^n | Design Turing Machine
• Lec-61: Turing Machine for a^nb^nc^n | Design Turing Machine
• Lec-62: Turing Machine for 1's Complement | Transition Table & Diagram
• Lec-63: Modifications in Turing machine
• Lec-64: Recursive vs Recursive Enumerable Languages | TOC
• Lec-65: Decidability & Undecidability table in toc for all languages
• Lec-66: Important Question on Decidability and closure property | TOC
• Lec-67: TOC Most Imp 10 Questions with explanation | 10 Questions for every exam
• Lec-68: TOC Most Imp 10 Questions for Every Exam | TOP 10 Imp questions of Theory of Computation