Theory of Computation

1
Objectives of Subject
 Introduce concepts in automata theory and theory of
computation
 Identify different formal language classes and their
relationships
 Design grammars and recognizers for different formal
languages
 Prove or disprove theorems in automata theory using
its properties
 Determine the decidability and intractability of
computational problems

2
 Subject Organization
 Very broadly, the TOC will contain four parts:

 Part I) Regular languages(FA)

 Part II) Context-free languages(PDA)
 Part III)Context-Sensitive languages(LBA)
 Part III) Recursively-enumerable languages (TM)

3
Chomsky Hierarchy