Theory of Computation
Gujarat Technological University • Information Technology • Sem 5 • 4 credits
📚 Syllabus Topics
- 1. Finite Automata: DFA, NFA, Regular Expressions
- 2. Regular Languages & Pumping Lemma
- 3. Context-Free Grammars & Pushdown Automata
- 4. Turing Machines & Decidability
- 5. Undecidability & Halting Problem
- 6. Complexity Classes: P, NP, NP-Complete
📄 Previous Year Questions (PYQ)
Is semester ke saare papers ek saath dekho →Is subject ke PYQ jaldi aa rahe hain. Neeche notes request kar do — hum priority par laayenge.
📝 Notes
Abhi koi notes nahi hain — neeche request karo.
✅ Paper Solutions
Paper solutions jaldi aa rahe hain.