Theory of Computer Science

Supplemental materials are not guaranteed for used textbooks or rentals (access codes, DVDs, CDs, workbooks).

Theory of Computer Science

Author:

Availability: Out Of Stock

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 Expanded sections on pigeonhole principle and the principle of induction (both in Chapter 2) A rigorous proof of Kleenes theorem (Chapter 5) Major changes in the chapter on Turing machines (TMs) A new section on high-level description of TMs Techniques for the construction of TMs Multitape TM and nondeterministic TM A new chapter (Chapter 10) on decidability and recursively enumerable languages A new chapter (Chapter 12) on complexity theory and NP-complete problems A section on quantum computation in Chapter 12. KEY FEATURES Objective-type questions in each chapterwith answers provided at the end of the book. Eighty-three additional solved examplesadded as Supplementary Examples in each chapter. Detailed solutions at the end of the book to chapter-end exercises. The book is designed to meet the needs of the undergraduate and postgraduate students of computer science and engineering as well as those of the students offering courses in computer applications.

This book is out of stock

Seller: BookChor
Dispatch Time : 1-3 working days
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 Expanded sections on pigeonhole principle and the principle of induction (both in Chapter 2) A rigorous proof of Kleenes theorem (Chapter 5) Major changes in the chapter on Turing machines (TMs) A new section on high-level description of TMs Techniques for the construction of TMs Multitape TM and nondeterministic TM A new chapter (Chapter 10) on decidability and recursively enumerable languages A new chapter (Chapter 12) on complexity theory and NP-complete problems A section on quantum computation in Chapter 12. KEY FEATURES Objective-type questions in each chapterwith answers provided at the end of the book. Eighty-three additional solved examplesadded as Supplementary Examples in each chapter. Detailed solutions at the end of the book to chapter-end exercises. The book is designed to meet the needs of the undergraduate and postgraduate students of computer science and engineering as well as those of the students offering courses in computer applications.
Additional Information
Title Theory of Computer Science Height
Mishra KLP , Chandrasekaran N Width
ISBN-13 9788120329683 Binding Paperback
ISBN-10 #8120329686 Spine Width
Publisher PHI Learning Pages 436
Edition 2010 Availability Out Of Stock

Goodreads reviews


Free shipping

On order over ₹200
 

Replacement

15 days easy replacement
 

9466501218

Customer care available