GATE CSE · 4 chapters

Theory of Computation chapter-wise PYQs

One PDF per chapter, with every question asked in past GATE CSE papers and an answer key.

  1. 01
    Finite Automata and Regular Language 114 questions 36 pages · 5.6 MB
  2. 02
    Push Down Automata and Context Free Language 70 questions 19 pages · 2.5 MB
  3. 03
    Undecidability 15 questions 5 pages · 711 KB
  4. 04
    Recursively Enumerable Language and Turing Machine 36 questions 11 pages · 1.2 MB