Course module
Theory Of ComputationZERO TO HERO
- Lessons
- 212
- Duration
- 15 hr 52 min
- PYQs
- 0
- Practice
- 1098
Syllabus index
Lessons in this module
Introduction to TOC
Basics & String Ops
- Basics & String OpsPdf
- Introduction to TocDrm Video
- Requirement Of TOCDrm Video
- What is symbol, Alphabet, String and LanguageDrm Video
- How to represent a LanguageDrm Video
- Some basic operations on stringsDrm Video
- Reverse of a stringDrm Video
- Empty-Null StringDrm Video
- SubstringDrm Video
- PRACTICE QUESTION STRINGSDrm Video
- Prefix and suffixDrm Video
- Practice question Proper prefixesDrm Video
- Kleene ClosureDrm Video
- Practice Question StringsDrm Video
Deterministic FA (DFA)
DFA Basics & Definitions
DFA Construction & Design
- DFA Construction & DesignPdf
- DFA Designing where L={a}Drm Video
- DFA Designing where starts with substring sDrm Video
- DFA Designing where string ends with substring ‘s’Drm Video
- DFA Designing string contains sub string sDrm Video
- DFA Designing string start and end with aDrm Video
- Practice Question LanguageDrm Video
- DFA Designing string start and end with same symbolDrm Video
- DFA Designing string start and end with different symbolDrm Video
- DFA Designing where starts with s = aaa or bbbDrm Video
- DFA Designing string ends with s = aaa or bbbDrm Video
- DFA Designing sting with substring s = aaa or bbbDrm Video
- Practice Questions LanguageDrm Video
- DFA Designing sting where |w| = 3, |w| <= 3, |w| >= 3Drm Video
- DFA Designing sting where number of a = 2Drm Video
- DFA Designing sting where number of a >= 2Drm Video
- DFA Designing sting where |w|=0(mod3), |w|=1(mod4)Drm Video
- DFA Designing sting where number of a =0(mod3)Drm Video
- 720p _ 19.1 Gate 2015Drm Video
- Practice Questions DFADrm Video
- DFA Designing sting where odd occurance of subsring 'ab'Drm Video
- DFA Designing sting where even occurance of subsring 'baa'Drm Video
- How Many Different DFA's Can Be Designed Part-1Drm Video
- How Many Different DFA's Can Be Designed Part-2Drm Video
- Empty Language AcceptanceDrm Video
- Universal Language AcceptanceDrm Video
- DFA Designing where string contain b as 2nd symbol from leftDrm Video
- DFA Designing where string contain b as 2nd symbol fromRightDrm Video
- DFA Designing where string start with a and w=omod3Drm Video
- DFA Designing where string contain even number of a and bDrm Video
- |a|= 0(mod2) |b|= 0(mod3) |c|= 0(mod5)Drm Video
- DFA Design For String Has a DecimalDrm Video
- Design DFA for Language Part-1Drm Video
- Design DFA for Language Part-2Drm Video
- Design DFA for Language Part-3Drm Video
- Design DFA for Language Part-4Drm Video
Non-Deterministic FA
NFA Basics & Design
- NFA Basics & DesignPdf
- Basics of NDFADrm Video
- Important Points of NDFADrm Video
- Acceptance By NDFADrm Video
- NDFA Designing where starts with substring sDrm Video
- NDFA Designing where every string ends with substring sDrm Video
- NDFA Designing where every string contains substring sDrm Video
- NDFA Designing where every string starts and ends with sameDrm Video
- NDFA where every string starts and ends with different symboDrm Video
- NDFA where every string starts with aaa or bbbDrm Video
- NDFA where every string of length =w, <=w, >=wDrm Video
- NDFA where every string contains exactly two aDrm Video
- NDFA where 3 symbol from right end is aDrm Video
- Practice QuestionDrm Video
NFA to DFA Conversion
Epsilon NFA & Conversion
Regularity & Identification
- Regularity & IdentificationPdf
- Regular Language Indetification Part-1Drm Video
- Regular Language Indetification Part-2Drm Video
- Regular Language Indetification Part-3Drm Video
- Regular Language Indetification Part-4Drm Video
- Regular Language Indetification Part-5Drm Video
- Regular Language Indetification Part-6Drm Video
- Regular Language Indetification Part-7Drm Video
Regular Expressions
Regex Basics & Definitions
Regex Design & Algebra
- Regex Design & AlgebraPdf
- Regular Language to Regular Expression Part-1Drm Video
- Regular Language to Regular Expression Part-2Drm Video
- Regular Language to Regular Expression Part-3Drm Video
- Regular Language to Regular Expression Part-4Drm Video
- Regular Language to Regular Expression Part-5Drm Video
- Regular Language to Regular Expression Part-6Drm Video
- Regular Language to Regular Expression Part-7Drm Video
- Regular Language to Regular Expression Part-8Drm Video
- Regular Language to Regular Expression Part-9Drm Video
- Algebraic Properties of Regular ExpressionDrm Video
- Identities of Regular Expression Part-1Drm Video
- Identities of Regular Expression Part-2Drm Video
- Practice Questions_REDrm Video
- Practice Question_LanguageDrm Video
FA to Regex Conversion
Grammar
Chomsky & Basics
Grammar Design via Regex
- Grammar Design via RegexPdf
- Practice QuestionDrm Video
- Practice QuestionDrm Video
- Practice QuestionDrm Video
- Practice QuestionDrm Video
- Practice QuestionDrm Video
- Grammar Design form Regular Expression part-1Drm Video
- Grammar Design form Regular Expression part-2Drm Video
- Regular grammar to regular expressionDrm Video
- Regular grammar to regular expressionDrm Video
Regular Language Properties
Decidability & Basics
Closure Properties
Pumping Lemma
Moore & Mealy Machines
Basics & Moore Machine
Pushdown Automata & CFG
PDA Design & Basics
- PDA Design & BasicsPdf
- Fundamental of CFL and PDADrm Video
- Formal Definition of DPDADrm Video
- Push, Pop and Skip OperationsDrm Video
- PDA Design Practice Problem Part - 1Drm Video
- PDA Design Practice Problem Part-2Drm Video
- Design Practice Problem Part - 3Drm Video
- PDA Design Practice Problem Part - 4Drm Video
- PDA Design Practice Problem Part - 5Drm Video
- Practice Question - 1Drm Video
- Practice Question - 2Drm Video
- Practice Question - 3Drm Video
Context-Free Grammars
Decision Properties
Closure Properties
Turing Machines
TM Basics & Design
- TM Basics & DesignPdf
- Fundamentals of Turing MachineDrm Video
- Formal Defination of Turing machine with componentsDrm Video
- Turing Machine Design Practice Problem Part-1Drm Video
- Turing Machine Design Practice Problem Part-2Drm Video
- Turing Machine Design Practice Problem Part-3_Drm Video
- Adding Two Unary NumberDrm Video
- Converting Unary to BinaryDrm Video
- Turing Machine_Practice Questions_1Drm Video
- Halting ProblemDrm Video
TM Variations & UTM
Decision Properties
Linear Bounded Automata
Complexity Theory
P, NP & Reducibility
Explore the course
- Database Management System
- Discrete Mathematics
- Digital Electronics
- Computer Architecture
- Operating System
- Computer Networks
- Data Structures
- Algorithms
- Compiler Design
- C language
- Software Engineering
- Artificial Intelligence
- Computer Graphics
- Aptitude
- Reasoning
- English (Verbal Ability)
- Engineering Mathematics
- GATE Live Class Recordings 2026
Loading lesson…