Hot Best Seller

Theory of Computer Science: Automata, Languages and Computation, 3/E

Availability: Ready to download

Theory of Computer Science is a book designed to meet the needs of the undergraduate and postgraduate students of computer science and engineering as well as those of the students who are pursuing the course on computer applications. The book is now in its third edition, and offers a cohesive presentation of all aspects of theoretical computer science, namely automata, for Theory of Computer Science is a book designed to meet the needs of the undergraduate and postgraduate students of computer science and engineering as well as those of the students who are pursuing the course on computer applications. The book is now in its third edition, and offers a cohesive presentation of all aspects of theoretical computer science, namely automata, formal languages, computability, and complexity. Besides, it includes coverage of mathematical preliminaries as well as well. The new edition also comes in with an expanded section on pigeonhole principle and the principle of induction and a new section on high-level description of TMs – Techniques for the construction of TMs – Multitape TM and non-deterministic TM. Two new chapters on Decidability and Recursively Enumerable Languages and Complexity Theory and NP-complete Problems are also added.


Compare

Theory of Computer Science is a book designed to meet the needs of the undergraduate and postgraduate students of computer science and engineering as well as those of the students who are pursuing the course on computer applications. The book is now in its third edition, and offers a cohesive presentation of all aspects of theoretical computer science, namely automata, for Theory of Computer Science is a book designed to meet the needs of the undergraduate and postgraduate students of computer science and engineering as well as those of the students who are pursuing the course on computer applications. The book is now in its third edition, and offers a cohesive presentation of all aspects of theoretical computer science, namely automata, formal languages, computability, and complexity. Besides, it includes coverage of mathematical preliminaries as well as well. The new edition also comes in with an expanded section on pigeonhole principle and the principle of induction and a new section on high-level description of TMs – Techniques for the construction of TMs – Multitape TM and non-deterministic TM. Two new chapters on Decidability and Recursively Enumerable Languages and Complexity Theory and NP-complete Problems are also added.

30 review for Theory of Computer Science: Automata, Languages and Computation, 3/E

  1. 5 out of 5

    Nilesh Kalekar

    jdey

  2. 5 out of 5

    Faiza

  3. 5 out of 5

    Anshula

  4. 5 out of 5

    Ahmed Majid

  5. 5 out of 5

    Amit

  6. 5 out of 5

    Madhuparna Saha

  7. 5 out of 5

    Sandeep S

  8. 5 out of 5

    Sonia

  9. 5 out of 5

    Sushil

  10. 5 out of 5

    Balwant Singh

  11. 5 out of 5

    Shalini Verma

  12. 5 out of 5

    Pandit Upadhyay

  13. 4 out of 5

    Afzal Khan

  14. 5 out of 5

    Awadhesh Kumar

  15. 4 out of 5

    Sweety

  16. 5 out of 5

    Addy Prakash Nautiyal

  17. 4 out of 5

    Sujata

  18. 4 out of 5

    Sumanta Paran

  19. 4 out of 5

    Jovany Agathe

  20. 4 out of 5

    Ashish Sharma

  21. 4 out of 5

    Doodle

  22. 5 out of 5

    Malik Nadeem

  23. 5 out of 5

    Sana

  24. 5 out of 5

    Indrajeet

  25. 4 out of 5

    Priyanka

  26. 5 out of 5

    Akshat Mathur

  27. 4 out of 5

    Tarun Khatri

  28. 4 out of 5

    Akash

  29. 5 out of 5

    Shyamriti Das

  30. 5 out of 5

    Anukulta

Add a review

Your email address will not be published. Required fields are marked *

Loading...
We use cookies to give you the best online experience. By using our website you agree to our use of cookies in accordance with our cookie policy.