**CS8501 Notes THEORY OF COMPUTATION**

CS8501 Notes Theory Of Computation Regulation 2017 Anna University free download. Theory Of Computation Notes CS8501 pdf free download.

**OBJECTIVES: CS8501 Notes Theory Of Computation**

To understand the language hierarchy

To construct automata for any given pattern and find its equivalent regular expressions

To design a context free grammar for any given language

To understand Turing machines and their capability

To understand undecidable problems and NP class problems

**OUTCOMES: CS8501 Notes Theory Of Computation**

Upon completion of the course, the students will be able to:

Construct automata, regular expression for any pattern.

Write Context free grammar for any construct.

Design Turing machines for any language.

Propose computation solutions using Turing machines.

Derive whether a problem is decidable or not.

**TEXT BOOK: CS8501 Notes Theory Of Computation**

1. J.E.Hopcroft, R.Motwani and J.D Ullman, ―Introduction to Automata Theory, Languages and Computations‖, Second Edition, Pearson Education, 2003.

**REFERENCES: CS8501 Notes Theory Of Computation**

1. H.R.Lewis and C.H.Papadimitriou, ―Elements of the theory of Computation‖, Second Edition,

PHI, 2003.

2. J.Martin, ―Introduction to Languages and the Theory of Computation‖, Third Edition, TMH, 2003.

3. Micheal Sipser, ―Introduction of the Theory and Computation‖, Thomson Brokecole, 1997.

Subject name | THEORY OF COMPUTATION |

Short Name | TOC |

Semester | 5 |

Subject Code | CS8501 |

Regulation | 2017 regulation |

**CS8501 Notes THEORY OF COMPUTATION ****Click Here To Download**

**CS8501 THEORY OF COMPUTATION Syllabus**

**CS8501 THEORY OF COMPUTATION Important Questions**

**CS8501 THEORY OF COMPUTATION Question Bank**

**CS8501 THEORY OF COMPUTATION Question Paper**

mpmc notes please