Skip to main content
grasp.study
About
Explore
Pricing
Log in
Try it for free
Back to course
👋
Welcome to a Grasp lesson
Create a free account
to keep studying and create your own study path.
GATE CS 2026 Mastery Course
·
Module 9
Theory of Computation
Regular Expressions and Finite Automata
Construct a regular expression and a finite automaton (DFA/NFA) for a given regular language.
2
NFA to DFA Conversion (Subset Construction)
Convert a given NFA (with or without ε-transitions) to an equivalent DFA using the subset construction method.
3
DFA Minimization Using the Table-Filling Algorithm
Minimize a given DFA to its minimal equivalent form using the table-filling algorithm.
4
Proving Non-Regularity with the Pumping Lemma
Prove that a given language is not regular using the Pumping Lemma for Regular Languages.
CFG to CNF Conversion
Design a Context-Free Grammar (CFG) for a given context-free language and convert it to Chomsky Normal Form (CNF).
6
Designing PDAs for Context-Free Languages
Construct a Pushdown Automaton (PDA) that accepts a given context-free language.
Pumping Lemma and Closure Properties of CFLs
Apply the Pumping Lemma for CFLs to prove a language is not context-free and identify closure properties of CFLs.
Undecidability and Reductions from the Halting Problem
Explain the concept of undecidability and use reductions from the Halting Problem to prove that other problems are undecidable.
Previous module
Design & Analysis of Algorithms
Next module
Compiler Design