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