CS6503 Notes Theory of Computation
CS6503 Notes Theory of Computation Regulation 2013 Anna University free download. Theory of Computation TOC CS6503 Notes pdf free download.
OBJECTIVES: CS6503 Notes Theory of Computation TOC
The student should be made to:
Understand various Computing models like Finite State Machine, Pushdown Automata, and Turing Machine.
Be aware of Decidability and Un-decidability of various problems.
Learn types of grammars.
OUTCOMES: CS6503 Notes Theory of Computation TOC
At the end of the course, the student should be able to: Design Finite State Machine, Pushdown Automata, and Turing Machine. Explain the Decidability or Undecidability of various problems
TEXT BOOKS: CS6503 Notes Theory of Computation TOC
1. Hopcroft J.E., Motwani R. and Ullman J.D, “Introduction to Automata Theory, Languages and Computations”, Second Edition, Pearson Education, 2008. (UNIT 1,2,3)
2. John C Martin, “Introduction to Languages and the Theory of Computation”, Third Edition, Tata McGraw Hill Publishing Company, New Delhi, 2007. (UNIT 4,5)
REFERENCES: CS6503 Notes Theory of Computation TOC
1. Mishra K L P and Chandrasekaran N, “Theory of Computer Science – Automata, Languages and Computation”, Third Edition, Prentice Hall of India, 2004.
2. Harry R Lewis and Christos H Papadimitriou, “Elements of the Theory of Computation”, Second Edition, Prentice Hall of India, Pearson Education, New Delhi, 2003.
3. Peter Linz, “An Introduction to Formal Language and Automata”, Third Edition, Narosa Publishers, New Delhi, 2002.
4. Kamala Krithivasan and Rama. R, “Introduction to Formal Languages, Automata Theory and Computation”, Pearson Education 2009.
| Subject Name | Theory of Computation |
| Subject code | CS6503 |
| Regulation | 2013 |
CS6503 Notes Theory of Computation click here to download
CS6503 Syllabus Theory of Computation
CS6503 Important Questions Theory of Computation
CS6503 Question Bank Theory of Computation