Theory Of Computation – CS301 (2015 Scheme)

Course SyllabusDownload

Course OutcomeDownload

Module – 1Download

Module – 2Download

Module – 4Download

Module – 5Download

Module – 6Download

Text Book – Automata TheoryDownload

University Question Paper – December 2017Download

University Question Paper – April 2018Download

University Question Paper – December 2018Download

University Question Paper – May 2019Download

University Question Paper – December 2019Download

University Question Paper – September 2020Download

GATE SYLLABUS – Regular expressions and finite automata. Context-free grammars and push-down automata. Regular and context-free languages, pumping lemma. Turing machines and undecidability.