Loading...
「ツール」は右上に移動しました。
1225いいね 71278回再生

Theory of Computation | TOC in one shot | Complete GATE Course | Hindi #withsanchitsir

💻 KnowledgeGate Website: www.knowledgegate.ai/

For free notes on GATE/PSU/NET subjects, please check out our course: www.knowledgegate.ai/courses/FREE-GATE-BUNDLE

📝 Please message us on WhatsApp: wa.me/918000121313

➡ Contact Us: 👇
📞Call on: +91-8000121313
🟦 Telegram Updates: t.me/kg_gate
🟩 Whatsapp Updates: www.whatsapp.com/channel/0029VaC5Weq2Jl85NaTls63w
📧 Email: contact@knowledgegate.in

➡ One Shot Complete Playlist for GATE CSE Exam : 👇
▶️ tiny.cc/GATEoneshotplaylist

➡ Our One Shot Semester Exam Videos: 👇
▶ Operating System:    • Complete Operating System in one shot...  
▶ DBMS:    • Complete DBMS Data Base Management Sy...  
▶ Computer Network:    • Complete CN Computer Networks in one ...  
▶ Digital Electronics:    • Complete DE Digital Electronics in on...  
▶ Computer Architecture:    • Complete COA Computer Organization & ...  
▶ Data Structure:    • Complete DS Data Structure in one sho...  
▶ Algorithm:    • Complete DAA Design and Analysis of A...  
▶ Software Engineering:    • Complete Software Engineering in one ...  
▶ Theory of Computation:    • Complete TOC Theory of Computation in...  
▶ Compiler:    • Complete CD Compiler Design in one sh...  
▶ Discrete Maths:    • Complete DM Discrete Maths in one sho...  
▶ Artificial Intelligence:    • Complete AI Artificial Intelligence i...  
▶ Machine Learning:    • Complete ML Machine Learning in one s...  

#knowledgegate #GATE #sanchitjain
*********************************************************
Content in this video:
0:00 Ch-1 About this video
1:38 Ch-2 Basics of TOC
24:18 Ch-2 Operations on Strings
44:36 Ch-3 DFA
1:54:16 Ch-4 DFA Minimization
2:16:40 Ch-5 NFA
2:33:48 Ch-6 NFA to DFA Conversion
2:51:04 Ch-7 ε-NFA
2:56:47 Ch-8 ε-NFA to NFA Concersion
3:12:36 Ch-9 Regular Language Identification
3:53:56 Ch-10 Regular Expressions (RE)
4:50:42 Ch-11 FA to RE
5:10:30 Ch-12 RE to FA
5:40:26 Ch-13 Chomsky Classification of Grammars
6:24:21 Ch-14 Regular Grammar to Regular Expressions
6:35:57 Ch-15 Decision & Closure Properties of RL
7:18:36 Ch-16 Moore and Mealy Machine
8:00:27 Ch-17 PUSH DOWN AUTOMATA(PDA)
8:39:40 Ch-18 Context Free Language Identification
9:11:11 Ch-19 Context Free Grammar
10:01:13 Ch-20 Decision & Closure Properties of CFL
10:33:54 Ch-21 Turing Machine Designing
11:10:55 Ch-22 Versions of Turing Machines
11:13:28 Ch-23 Haulting Problem of Turing Machines
11:23:07 Ch-24 Universal Turing Machines
11:26:18 Ch-25 Linear Bounded Automata
11:29:52 Ch-26 Decision & Closure Properties of