# Theory of Computation (TOC)

This repository is a comprehensive resource for the Theory of Computation (TOC) course under the SPPU 2019 pattern. It covers essential topics such as formal languages, translation logic, and the design of computational models, including Finite Automata, Pushdown Automata, and Turing Machines. You will learn to construct regular expressions, Context Free Grammars, and explore concepts like the Pumping Lemma and NP completeness, equipping them with the theoretical and practical skills needed for effective computational analysis and design.

---

## Index

### Notes
1. [Unit 1 - Formal Language Theory and Finite Automata](Notes/Unit%201%20-%20Formal%20Language%20Theory%20and%20Finite%20Automata)
2. [Unit 2 - Regular Expressions](Notes/Unit%202%20-%20Regular%20Expressions)
3. [Unit 3 - Context Free Grammar (CFG) and Context Free Language (CFL)](Notes/Unit%203%20-%20Context%20Free%20Grammar%20%28CFG%29%20and%20Context%20Free%20Language%20%28CFL%29)
4. [Unit 4 - Pushdown Automata (PDA)](Notes/Unit%204%20-%20Pushdown%20Automata%20%28PDA%29)

### Assignments
1. [Assignment - 1](Assignments/TOC%20-%20Assignment%201.pdf)
2. [Assignment - 2](Assignments/TOC%20-%20Assignment%202.pdf)

### Question Papers
- [IN-SEM](Question%20Papers/IN-SEM)
- [END-SEM](Question%20Papers/END-SEM)

> [Sample IN-SEM Unit Test Paper](Question%20Papers/TOC%20-%20Unit%20Test%20Sample%20Paper%20%28IN-SEM%2C%202019%20Pattern%29.pdf)