Theory of Computation (CMP 254) — Semester IV notes, Pokhara University BECE
Theory of automata, formal languages and computation: finite automata, regular expressions, context-free grammars, pushdown automata, Turing machines, decidability and computational complexity.
10 files: lecture notes, question collections, lab reports and more for Theory of Computation.
Syllabus
- Theory of Computation.pdf
Extras
- CNF vs GNF.jpg
- Recursive vs Recursive Enumerable .jpg
Files
- Guide Book TOC.pdf
- Handwritten Note TOC 2.pdf
- Handwritten Note TOC.pdf
NCIT Assignments
- TOC_UTSoln.pdf
NCIT Notes
- Computational Complexity.pdf
- TOC_Handwritten.pdf
- Undecidability.pdf