Theory of Computation GATE CS Syllabus : Regular expressions and finite automata. Context-free grammars and push-down automata. Regular and context-free languages, pumping lemma. Turing machines and undecidability.
Theory of Computation(ToC) Lectures and GATE CS Previous Year Questions(PYQ) Slides by Monalisa Pradhan
->Chapter 1:Regular Language (RL,FA,RE ,Pumping lemma)
->Chapter 2: Context free Language [Grammar(RG,CFG),CFL,PDA, Pumping lemma]
->Chapter 3: Recursive enumerable Language [CSL, LBA ,RS,RES,TM]
->Chapter 4: Undecidability(Undecidable, Rice Theorem ,Reducibility, PCP)