Theory of Computation
Regular expressions and finite automata, Context-free grammars and push-down automata, Regular and context-free languages, pumping lemma, Turing machines, and undecidability.
Detailed Syllabus covered in Notes
DFA, NFA, Minimization of DFA, Mealy and Moore Machines, Epsilon (ε) NFA, Families of Formal Languages, Regular Expressions and Conversions, Regular Languages, Grammar, PDA, Turing Machine, Countability, Computability and decidability, Properties of Regular Languages, Decidable problems on Regular Languages, Problems of CFL’s
Related Links
- Engineering Maths – Click Here
- Digital Logic (PDF Notes) – Click Here
- Programming and DS (PDF Notes) – Click Here
- Computer Organization and Arch. (PDF Notes) – Click Here
- Algorithms (PDF Notes) – Click Here
- Compiler Design (PDF Notes) – Click Here
- Operating System (PDF Notes) – Click Here
- DBMS (PDF Notes) – Click Here
- Computer Networks (PDF Notes) – Click Here