Learn Theory of Computation, with pictures you can poke.
Short concepts, every formula in one place, interactive animations, and the question types that keep repeating in past GATE papers.
Syllabus. Regular expressions and finite automata. Context-free grammars and push-down automata. Regular and context-free languages, pumping lemma. Turing machines and undecidability.
Study order
Highest yield first. Tick a topic when you are done with it.
0 of 7 topics done
Finite Automata (DFA, NFA, ε-NFA)
The most predictable TOC marks: count states of a minimal DFA, read the language of a given automaton, convert NFA to DFA.
Regular Expressions & Regular Languages
Closure-property statements, regex identities and "is this language regular?" (pumping lemma) appear almost every year.
Context-Free Grammars & Languages
Ambiguity, normal forms, closure of CFLs and "is it a CFL?" questions are among the most repeated.
Pushdown Automata
Design a PDA, decide deterministic vs nondeterministic, and relate PDAs to CFGs.
Language Hierarchy & Closure Tables
One table to rule them all: closure and decidability properties of every class, plus classifying a language.
Decidability & Undecidability
Halting problem, reductions and Rice's theorem: guaranteed conceptual questions.
Turing Machines
Recursive versus recursively enumerable, TM variants, and what a TM can do.
What gets asked, at a glance
Most frequent question types across topics (rating is approximate).
Importance and frequency ratings are my reading of recurring GATE CSE patterns, not an official count. Cross-check against a PYQ set before relying on them for exact marks.
Frequently asked questions
How many marks does Theory of Computation carry in GATE CSE?
By my estimate about 7 to 9 marks per paper. This is an estimate from recurring patterns in past papers, not an official count, and it varies from year to year.
What topics are in Theory of Computation for GATE CSE?
Finite Automata (DFA, NFA, ε-NFA); Regular Expressions & Regular Languages; Context-Free Grammars & Languages; Pushdown Automata; Language Hierarchy & Closure Tables; Turing Machines; Decidability & Undecidability.
Which Theory of Computation topics are most important for GATE?
The highest-yield topics are Finite Automata (DFA, NFA, ε-NFA); Regular Expressions & Regular Languages; Context-Free Grammars & Languages; Pushdown Automata; Language Hierarchy & Closure Tables; Decidability & Undecidability. Importance is my estimate from recurring question patterns.
Where can I find solved GATE Theory of Computation previous year questions?
This page links to 53 previous year question entries from 2012 to 2025, each with the official answer key and a worked solution.