Theory Of Computer Science Book

We are indulged in manufacturing and exporting of Theory Of Computer Science Book to our patrons. This Third Edition, in response to the enthusiastic reception given by academia and students to the previous edition, 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.

NEW TO THIS EDITION

a c Expanded sections on pigeonhole principle and the principle of induction (both in Chapter 2)
a c A rigorous proof of Kleenea s theorem (Chapter 5)
a c Major changes in the chapter on Turing machines (TMs) a A new section on high-level description of TMs a Techniques for the construction of TMs a Multitape TM and nondeterministic TM
a c A new chapter (Chapter 10) on decidability and recursively enumerable languages
a c A new chapter (Chapter 12) on complexity theory and NP-complete problems
a c A section on quantum computation in Chapter 12.