Theory of Computation: Computer Science questions with solutions
Practise Theory of Computation (Computer Science) chapter-wise, with questions from GATE Computer Science and IT (CS) and a solution for each. A free preview needs no card.
Questions by exam
- GATE Computer Science and IT (CS) · 329 questions
Subtopics covered
- Regular Languages & Finite Automata
- Context-Free Languages & Pushdown Automata
- Turing Machines
- Undecidability