GATE CS Theory of Computation Syllabus: Topics and Previous Year Questions
The full GATE CS Theory of Computation syllabus — 10 topics. Previous year questions for this subject are being added. Sign up free to practise every question, topic by topic, with the answer to each one.
Regular Expression Coming soon
Regular Grammar Coming soon
Regular Language Coming soon
Covers: Regular Languages · Pumping Lemma for Regular Languages · Closure Properties of Regular Languages
Finite Automata Coming soon
Covers: Finite Automata (DFA) · NFA and Conversion to DFA · DFA Construction and Counting States · DFA Minimization · Finite Automata with Output (Mealy, Moore)
Context Free Grammar Coming soon
Context Free Language Coming soon
Covers: Pumping Lemma for CFLs · Normalisation of CFG, DCFL, CFL and Closure Properties
Push-down Automata Coming soon
Recursive Language Coming soon
Covers: Recursive and RE Language Identification · Closure Properties of Recursive and RE Languages · LBA and Context-Sensitive Languages
Turing Machine Coming soon
Undecidability Coming soon
Covers: Decidability and Undecidability · Reducibility and Complexity
Practise Theory of Computation
Sign up free to work through every GATE CS Theory of Computation question, topic by topic, with the answer to each one.
Create your free accountSign in