B.Tech Mathematics

MA 351                           Theory of Computation                        4-0-0-8

Syllabus: Alphabets, languages, grammars; Finite automata, regular languages, regular expressions; Context-free languages, pushdown automata, DCFLs; Context sensitive languages, linear bounded automata; Turing machines, recursively enumerable languages; Operations on formal languages and their properties; Decidability; Undecidability; Cook’s theorem.

Texts:

1. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages and Computation, Narosa, 1995.
2. R. Lewis and C. H. Papadimitriou, Elements of the Theory of Computation, Pearson Education, 1998.

References:

1. Sipser, Introduction to the Theory of Computation, Thomson, 2004.
2. Linz, An Introduction to Formal Languages and Automata, Narosa, 2007.
3. C. Kozen, Automata and Computability, Springer, 1997.