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.
Go to file
2024-08-22 19:42:54 +05:30
Assignments Added assignment 1 & 2. 2024-08-22 19:42:54 +05:30
Notes Added turing machine, unit 1 notes. 2024-08-21 09:51:19 +05:30
Question Papers Added insem and endsem question papers. 2024-08-21 02:44:49 +05:30
README.md Made several changes to README. 2024-08-21 02:46:20 +05:30

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
  2. Unit 2 - Regular Expressions

Question Papers

Sample IN-SEM Unit Test Paper