There are no items in your cart
Add More
Add More
Item Details | Price |
---|
Truly "Understand" it, from Finite Automata to Decidability.
Learn, Understand, Discuss. "GO" for the Best.
star star star star star | 5.0 (48 ratings) |
Instructor: Deepak Poonia (MTech IISc Bangalore, GATE CSE AIR 53; 67; 107)
Language: English
Validity Period: 365 days
Enroll Now.
Know ALL About GO Classes GATE 2024 Complete Course
Enroll here for GO Classes GATE CSE Complete Course
Enroll here for GO+Goclasses TEST SERIES
Download GO Classes Android APP
Join GO Classes public Telegram Group for Doubt Discussions
Theory of computation(aka Automata Theory, Theory of formal languages etc) is an important field of Computer Science that is concerned with "which problems can be solved using algorithms or using programs" and how efficiently they can be solved.
Theory of computation(TOC) is one of the most important subjects for GATE Computer Science exam as well, having a weightage of around 8-10 marks.
Want to Truly "Understand" concepts like Decidability, Countability, Pumping lemma, Push-Down Automata etc??! Join the course and start learning.
From Finite Automata to Decidability, Understand everything with complete clarity.
Features of the course:
1. Quality Content: No Rote-learning. No poor understadning. No By-hearting of tables or theorems. Understand everything with proofs-intuitions-ideas.
2. No Prerequisites: Every concept is taught from basics, without assuming any prior knowledge whatsoever.
3. Daily Homeworks: Practice material, with solutions, for Every Lecture to test your understanding of concepts of respective lecture.
4. Summary Lectures: Short videos which summarises everything concept and detail of the course. Helps in quick revision.
5. Quality Practice Sets: Practice Sets from standard resources, with solutions, containing a lot of quality questions for practice.
6. Weekly Quizzes: Every week, there will be a Live Quiz, containing 15-20 questions, to evaluate your understanding of concepts taught in the previous week. The Quiz questions can be seen, solved even after the live quiz is over.
7. Doubt Resolution: All of your doubts will be resolved directly by the faculty, Deepak Poonia. There is a dedicated Telegram group for Enrolled Students of Goclasses where our faculties resolve students' Doubts. So, our students don't have to go anywhere else for asking doubts.
Enroll Now.
Know ALL About GO Classes GATE 2024 Complete Course
Enroll here for GO Classes GATE CSE Complete Course
Enroll here for GO+Goclasses TEST SERIES
Module 1 - Regular Languages & Finite Automata | |||
About Lecture 1 | |||
(OPTIONAL) Lecture 1 - Theory of Computation Introduction, Motivation, Overview | |||
Annotated Notes - Lecture 1 - Theory of Computation Introduction (99 pages) | |||
Lecture 2A - Basic Concepts - Alphabet, String 44:00 | |||
Lecture 2B - Basic Concepts - Concatenation of Strings 18:00 | |||
Lecture 2C - Basic Concepts - Prefix, Suffix, Substring, Subsequence 47:00 | |||
Lecture 3A - Language 20:00 | |||
Lecture 3B - Set Operations on Languages 26:00 | |||
Lecture 3C - Exponentiation of Language, Kleene Closure 37:00 | |||
Lecture 4 - Practice Questions - Basic Concepts 19:00 | |||
Annotated Notes - Lecture 2-4 - Basic Concepts (256 pages) | |||
Lecture 5 - Complement of a Language 34:00 | |||
Homework 1 - Basic Concepts - Peter Linz Exercise 1.2 Questions (23 pages) | |||
Homework 1 - Video Solution | |||
Annotated Notes - Homework 1 - Basic Concepts (87 pages) | |||
Lecture 6 - What we study in Theory of Computation & Why? 25:00 | |||
Lecture 7A - Finite Automata - Introduction 49:00 | |||
Annotated Notes - Lecture 5-7A - Complement of Language & Finite Automata Introduction (81 pages) | |||
Lecture 7B - Finite Automata - Part 2 53:00 | |||
Lecture 7C - Finite Automata Formal Definition & Rules 25:00 | |||
Lecture 8A - Deterministic Finite Automata DFA 26:00 | |||
Lecture 8B - Designing DFA Part 1 47:00 | |||
Lecture 8C - Designing DFA Part 2 30:00 | |||
Lecture 8D - Regular Language 17:00 | |||
Annotated Notes - Lecture 7B-8D - Finite Automata, DFA & Designing DFA (159 pages) | |||
Lecture 8E - Designing DFA Part 3 46:00 | |||
Lecture 8F - Designing DFA Part 4 36:00 | |||
Lecture 8G - Designing DFA Part 5 15:00 | |||
Lecture 8H - Designing DFA Part 6 27:00 | |||
Lecture 9 - Extended Transition Function in DFA 16:00 | |||
Lecture 10A - DFA for Complement of a Regular Language 28:00 | |||
Lecture 10B - Practice Questions 10:00 | |||
Annotated Notes - Lecture 8E-10B - Designing DFAs & Complement (141 pages) | |||
Homework 2 - Basics & DFA - Boston University Questions (31 pages) | |||
Homework 2 - Video Solution | |||
Annotated Notes - Homework 2 - Basics & DFA - Boston University Questions (66 pages) | |||
Lecture 10C - Recap - DFA for Complement of a Regular Language 10:00 | |||
Lecture 11 - The Product Construction of DFAs | |||
Annotated Notes - Lecture 10C-11 - The Product Construction of DFAs (118 pages) | |||
Lecture 12A - DFA Minimization - Part 1 26:00 | |||
Lecture 12B - DFA Minimization Part 2 - State Equivalence 50:00 | |||
Lecture 12C - DFA Minimization Part 3 - Practice Questions 21:00 | |||
Lecture 12D - DFA Minimization Part 4 - Practice Questions State Equivalence 29:00 | |||
Lecture 12E - DFA Minimization Part 5 - Partition Algorithm for DFA Minimization 54:00 | |||
Lecture 12F - DFA Minimization Part 6 - Practice Partition Algorithm 18:00 | |||
Annotated Notes - Lecture 12A-12F - DFA Minimization (174 pages) | |||
Lecture 13A - Configuration in DFA 8:00 | |||
Lecture 13B - Our First Non-Regular Language | |||
Lecture 14A - NFA Introduction 21:00 | |||
Lecture 14B - NFA Definition & Rules 26:00 | |||
Lecture 14C - Understanding Non-Determinism 41:00 | |||
Lecture 14D - Designing NFA | |||
Annotated Notes - Lecture 13A-14D - NFA (123 pages) | |||
Lecture 14E - Practice Questions 22:00 | |||
Lecture 14F - Null Moves in NFAs 42:00 | |||
Lecture 14G - Peter Linz Question on NFA 10:00 | |||
Lecture 14H - NFA Practice & NFA Extended Transition Function 26:00 | |||
Lecture 14i - NFA Formal Definition & Rules 15:00 | |||
Annotated Notes - Lecture 14E-14i - NFAs (107 pages) | |||
Lecture 15A - Extended Transition Function | |||
Annotated Notes - Lecture 15A - Extended Transition Function (145 pages) | |||
Lecture 15B - Equivalence of DFA & NFA | |||
Annotated Notes - Lecture 15B - Equivalence of DFA & NFA (143 pages) | |||
Weekly Quiz 24 - Finite Automata - Theory of Computation | |||
Lecture 16A - Regular Expression Part 1 62:00 | |||
Lecture 16B - Example Regular Expression 7:00 | |||
Annotated Notes - Lecture 16A-16B - Regular Expressions (73 pages) | |||
Lecture 16C - A Lot of Practice - Regular Expression 60:00 | |||
Lecture 16D - Regular Expression Analysis 20:00 | |||
Lecture 16E - Practice Questions - Regular Expression 24:00 | |||
Lecture 16F - Regular Expression - Analysis 27:00 | |||
Annotated Notes - Lecture 16C-16F - Regular Expression (140 pages) | |||
Lecture 16G - Important Properties of Regular Expressions 70:00 | |||
Lecture 16H - Some Basic Properties of Regular Expressions 11:00 | |||
Annotated Notes - Lecture 16G-16H - Important Properties of Regular Expressions (90 pages) | |||
Homework 3 - Regular Expression & FA - University Assignments Questions (45 pages) | |||
Homework 3 - Video Solutions | |||
Annotated Notes - Homework 3 - Regular Expression & FA - University Assignments Questions (195 pages) | |||
Lecture 17A - Equivalence of RE and FA - Part 1 - Somethings About NFAs 22:00 | |||
Lecture 17B - Equivalence of RE and FA - Part 2 - Converting RE to FA 28:00 | |||
Lecture 17C - Equivalence of RE and FA - Part 3 - FA to RE 7:00 | |||
Annotated Notes - Lecture 17A-17C - Equivalence of RE and FA (58 pages) | |||
Lecture 17D - Equivalence of RE and FA - Part 4 - FA to RE 20:00 | |||
Lecture 17E - Equivalence of RE and FA - Part 5 - Unary Alphabet DFA Analysis 32:00 | |||
Lecture 17F - Equivalence of RE and FA - Part 6 - The Two Templates | |||
Annotated Notes - Lecture 17D-17F - Equivalence of RE and FA (140 pages) | |||
Weekly Quiz 25 - Finite Automata & Regular Expression - Theory of Computation | |||
Lecture 18A - Pumping Lemma for Regular Languages - Part 1 | |||
Annotated Notes - Lecture 18A - Pumping Lemma for Regular Languages (190 pages) | |||
Lecture 18B - Pumping Lemma for Regular Languages - Part 2 | |||
Annotated Notes - Lecture 18B - Pumping Lemma for Regular Languages - Part 2 (109 pages) | |||
Lecture 18C - Pumping Lemma for Regular Languages - Part 3 | |||
Annotated Notes - Lecture 18C - Pumping Lemma for Regular Languages - Part 3 (86 pages) | |||
Lecture 18D - Pumping Lemma for Regular Languages - Part 4 - Proof | |||
Annotated Notes - Lecture 18D - Pumping Lemma for Regular Languages - Part 4 (150 pages) | |||
Lecture 18E - Pumping Lemma for Regular Languages - Part 5 - Practice | |||
Annotated Notes - Lecture 18E - Pumping Lemma for Regular Languages - Part 5 - Practice (149 pages) | |||
Lecture 19A - Myhill Nerode Theorem Part 1 118:00 | |||
Annotated Notes - Lecture 19A - Myhill Nerode Theorem Part 1 (128 pages) | |||
Lecture 19B - Myhill Nerode Theorem Part 2 - Distinguishable Strings 57:00 | |||
Lecture 19C - Myhill Nerode Theorem Part 3 - Practice 39:00 | |||
Lecture 19D - Myhill Nerode Theorem Part 4 - The Theorem 43:00 | |||
Annotated Notes - Lecture 19B-19D - Myhill Nerode Theorem - Distinguishable Strings (146 pages) | |||
Lecture 19E - Revision & Practice - Myhill Nerode Theorem | |||
Annotated Notes - Lecture 19E - Revision & Practice - Myhill Nerode Theorem (149 pages) | |||
Lecture 19F - Finding Number of States in Minimal DFA - Myhill Nerode Theorem | |||
Annotated Notes - Lecture 19F - Finding Number of States in Minimal DFA - Myhill Nerode Theorem (160 pages) | |||
Lecture 19G - GATE PYQs on Minimal DFA - Myhill Nerode Theorem | |||
Annotated Notes - Lecture 19G - GATE PYQs on Minimal DFA - Myhill Nerode Theorem (114 pages) | |||
Weekly Quiz 26 - Finite Automata & Regular Expression - Theory of Computation | |||
Feedback & Review | |||
Module 2 - Context Free Languages, Grammars, Pushdown Automata | |||
Lecture 1A - Context Free Grammars 137:00 | |||
Annotated Notes - Lecture 1A - Context Free Grammars (111 pages) | |||
Lecture 1B - Practice & Standard Examples of CFGs 113:00 | |||
Annotated Notes - Lecture 1B - Practice & Standard Examples of CFGs (99 pages) | |||
Lecture 1C - Regular Grammars | |||
Annotated Notes - Lecture 1C - Regular Grammar (163 pages) | |||
Lecture 1D - Every Regular Language is CFL - Proof 17:00 | |||
Annotated Notes - Lecture 1D - Every Regular Language is CFL - Proof (22 pages) | |||
Lecture 1E - Regular Grammar to NFA & Vice Versa | |||
Annotated Notes - Lecture 1E - Regular Grammar to NFA & Vice Versa (92 pages) | |||
Lecture 1F - Ambiguity of CFGs - Part 1 - Derivations, Parse Tree, LMD, RMD | |||
Annotated Notes - Lecture 1F - Ambiguity of CFGs - Part 1 - Derivations, Parse Tree, LMD, RMD (146 pages) | |||
Lecture 1G - Practice Questions - Parse Tree & Derivations | |||
Annotated Notes - Lecture 1G - Practice Questions - Parse Tree & Derivations (80 pages) | |||
Lecture 1H - Ambiguity of CFGs & CFLs | |||
Annotated Notes - Lecture 1H - Ambiguity of CFGs & CFLs (164 pages) | |||
Lecture 2A - Push Down Automata PDA - Definition & Rules | |||
Lecture 2B - PDA Practice Questions 38:00 | |||
Annotated Notes - Lecture 2A-2B - Push Down Automata PDA (116 pages) | |||
Lecture 2C - PDA Analysis - Understanding PDA Transitions & Non-Determinism 42:00 | |||
PDA Design Example 1 - a^nb^n Language 21:00 | |||
PDA Design Example 2 - a^nb^n+1 Language 12:00 | |||
PDA Design Example 3 - a^nb^m Language 11:00 | |||
PDA Design Example 4 - a^nb^m Language 7:00 | |||
PDA Design Example 5 - a^nb^m Language 13:00 | |||
PDA Design Example 6 - a^nb^2n Language 14:00 | |||
PDA Design Example 7 - a^2nb^n Language 17:00 | |||
Annotated Notes - Lecture 2C - PDA Analysis & Design (101 pages) | |||
Lecture 2D - PDA Design More Examples | |||
Lecture 2E - PDA Analysis, Empty Stack Acceptance 142:00 | |||
Annotated Notes - Lecture 2D-2E - PDA Design More Examples, Analysis (207 pages) | |||
Lecture 2F - Correction in a Question 13:00 | |||
Lecture 2G - Practice - PDA with Empty Stack Acceptance 27:00 | |||
Annotated Notes - Lecture 2F-2G - PDA with Empty Stack Acceptance (30 pages) | |||
Lecture 3A - DPDA Part 1 - What is Nondeterminism? 19:00 | |||
Lecture 3B - DPDA and DCFL 147:00 | |||
Annotated Notes - Lecture 3A-3B - DPDA and DCFL (176 pages) | |||
Feedback & Review | |||
Module 3 - Identification of Language Class | |||
Lecture 1A - Identification of Regular Languages | |||
Lecture 1B - Practice - Identification of Regular Languages 28:00 | |||
Lecture 1C - GATE CSE 2014 - Identification of Regular Languages | |||
Annotated Notes - Lecture 1A-1C - Identification of Regular Languages (117 pages) | |||
Lecture 2A - Identification of CFL, DCFL Languages | |||
Lecture 2B - Identification of CFL, DCFL Languages 109:00 | |||
Annotated Notes - Lecture 2A-2B - Identification of CFL, DCFL Languages (174 pages) | |||
Feedback & Review | |||
Module 4 - Closure Properties | |||
Lecture 1A - Closure Properties of Regular Languages | |||
Lecture 1B - Closure Properties of Regular Languages - Part 2 | |||
Annotated Notes - Lecture 1A-1B - Closure Properties of Regular Languages (261 pages) | |||
Lecture 2A - Closure Properties of CFLs | |||
Annotated Notes - Lecture 2A - Closure Properties of CFLs (198 pages) | |||
Lecture 2B - Closure Properties of DCFLs | |||
Lecture 3 - Closure Properties of Nonregular Languages | |||
Annotated Notes - Lecture 2B-3 - Closure Properties of DCFLs, Nonregular Languages (174 pages) | |||
Lecture 4 - Chomsky Hierarchy & Types of Grammars 62:00 | |||
Annotated Notes - Lecture 4 - Chomsky Hierarchy & Types of Grammars (71 pages) | |||
Lecture 5 - Non-Closure of Regular Languages 24:00 | |||
Annotated Notes - Lecture 5 - Non-Closure of Regular Languages (18 pages) | |||
Lecture 6 - Closure Properties of Finite Languages 16:00 | |||
(OPTIONAL) DCFLs are Not Closed under Concatenation and Kleene Closure 14:00 | |||
GATE CSE 2021 - Number of States in Minimal DFA for L and L-Complement 19:00 | |||
Homework 4 - PDA, CFG, Closure Properties - University Midterm Questions (21 pages) | |||
Feedback & Review | |||
Module 5 - Turing Machines, Undecidability | |||
Lecture 1 - Introduction of Turing Machines 122:00 | |||
Annotated Notes - Lecture 1 - Introduction of Turing Machines (107 pages) | |||
About Lecture 2 | |||
Lecture 2 - Turing Machine Design | |||
Lecture 3 - Turing Machine - Formal Definition 20:00 | |||
Lecture 4 - Some Conjectures | |||
Annotated Notes - Lecture 2-4 - Turing Machine Design, Definition (133 pages) | |||
Lecture 5 - Practice & Revision - Turing Machines | |||
Annotated Notes - Lecture 5 - Practice & Revision - Turing Machines (198 pages) | |||
Lecture 6 - Understanding Infinite Looping | |||
Annotated Notes - Lecture 6 - Understanding Infinite Looping (140 pages) | |||
Lecture 7 - Decider, Decidable 19:00 | |||
Annotated Notes - Lecture 7 - Decider, Decidable (21 pages) | |||
Lecture 8 - Revision - Story So Far - Turing Machines | |||
Lecture 9 - Dovetailing, Variants of TM 110:00 | |||
Annotated Notes - Lecture 8-9 - Dovetailing, Variants of TM (210 pages) | |||
Lecture 10 - Encoding and Decidability 80:00 | |||
Annotated Notes - Lecture 10 - Encoding and Decidability (61 pages) | |||
Lecture 11 - Language Vs Decision Problem 33:00 | |||
Annotated Notes - Lecture 11 - Language Vs Decision Problem (27 pages) | |||
Lecture 12A - Revision & Practice of Encoding | |||
Annotated Notes - Lecture 12A - Revision & Practice of Encoding (97 pages) | |||
Lecture 12B - Revision & Practice of Decision Problems & Languages | |||
Lecture 13 - Logically Solving Decision Problems related to Language of TMs 104:00 | |||
Annotated Notes - Lecture 12B-13 - Revision & Practice of Decision Problems & Languages (135 pages) | |||
Lecture 14A - Decision Problems of Regular Languages 101:00 | |||
Lecture 14B - Practice Questions on Decision Problems of Regular Languages 33:00 | |||
Annotated Notes - Lecture 14A-14B - Decision Problems of Regular Languages (155 pages) | |||
Lecture 15A - Simplification of Context Free Grammars - Useless Symbols Removal | |||
Annotated Notes - Lecture 15A - Simplification of Context Free Grammars - Useless Symbols Removal (63 pages) | |||
Lecture 15B - Simplification of CFGs - Null Production, Unit Production Removal 73:00 | |||
Lecture 15C - Normal Forms of CFGs - CNF, GNF 157:00 | |||
Annotated Notes - Lecture 15B-15C - Simplification of CFGs Part 2, Normal Forms (229 pages) | |||
Lecture 15D - Decision Problems of Context Free Languages 102:00 | |||
Annotated Notes - Lecture 15D - Decision Problems of Context Free Languages (69 pages) | |||
Lecture 16A - Universal TM, Membership Problem of TM 101:00 | |||
Lecture 16B - Halting Problem of TM, Existence of Non-RE Language 113:00 | |||
Annotated Notes - Lecture 16A-16B - Universal TM, Acceptance & Halting Problem of TM, Non-RE Language (137 pages) | |||
Lecture 16C - Rice Theorem | |||
Annotated Notes - Lecture 16C - Rice Theorem (99 pages) | |||
Lecture 16D - Practice and Revision - Rice Theorem 54:00 | |||
Lecture 16E - Rice Theorem Part 3 - Machine Property Vs Language Property 36:00 | |||
Lecture 16F - Rice Theorem for Programs 34:00 | |||
Annotated Notes - Lecture 16D-16F - Practice, Rice Theorem for Programs (127 pages) | |||
Lecture 17 - GATE Questions on Undecidability 111:00 | |||
Annotated Notes - Lecture 17 - GATE Questions on Decidability (61 pages) | |||
Lecture 18 - Closure Properties of RE, REC Languages, Complement Theorem 180:00 | |||
Annotated Notes - Lecture 18 - Closure Properties of RE,REC Languages, Complement Theorem (187 pages) | |||
Feedback & Review | |||
Module 6 - Countability | |||
Lecture 1 - Functions Revision, Cardinality & Understanding Infinity | |||
Annotated Notes - Lecture 1 - Functions Revision, Cardinality (231 pages) | |||
Lecture 2 - Countable Sets | |||
Lecture 3 - Uncountable Sets & Cantor's Diagonalization Proof | |||
Annotated Notes - Lecture 2,3 - Countable Sets, Uncountable Sets & Cantor's Diagonalization Proof (227 pages) | |||
Lecture 4 - Three Definitions of Countable Sets | |||
Annotated Notes - Lecture 4 - Three Definitions of Countable Sets (163 pages) | |||
Lecture 5 - Theorems for Countable Sets | |||
Annotated Notes - Lecture 5 - Theorems for Countable Sets (181 pages) | |||
Lecture 6 - Cantor's Theorem & Consequences | |||
Annotated Notes - Lecture 6 - Cantor's Theorem & Consequences (150 pages) | |||
Lecture 7 - Countability Results in Theory of Computation | |||
Annotated Notes - Lecture 7 - Countability Results in Theory of Computation (203 pages) | |||
Countability - GATE, TIFR, NET - ALL Previous Exams Questions (51 pages) | |||
Lecture 8 - Previous Exams Questions Discussion - GATE, TIFR, NET | |||
Annotated Notes - Lecture 8 - Previous Exams Questions Discussion - GATE, TIFR, NET (162 pages) | |||
Feedback & Review | |||
More Homeworks & Practice Sets | |||
Remaining Homeworks | |||
Homework 5 - More Questions on Basic Concepts (21 pages) | |||
Homework 5 - Video Solution | |||
Practice Set 1 - 45 Questions from UC Sen Diego University - Theory of Computation (69 pages) | |||
Feedback & Review | |||
Students' Hand Written Notes | |||
Notes by Quantum City (AIR 107, GATE CS 2024, Shreyas Rathod) - Theory of Computation Notes (75 pages) |
After successful purchase, this item would be added to your courses.
You can access your courses in the following ways :