This Third Edition, in response to the enthusiastic reception given by academia and students to the previo..."> This Third Edition, in response to the enthusiastic reception given by academia and students to the previo..."/>
Image of Theory of Computer Science (Automata, Languages and Computation)
Bookmark Share

Text

Theory of Computer Science (Automata, Languages and Computation)

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 Kleene's 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

Multitap 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 chapter-with answers provided at the end of the book.
Eighty-three additional solved examples-added as Supplementary Examples in each chapter.
Detailed solutions at the end of the book to chapter-end exercises.

Availability
#
Information Technology 004/MIS/IT0505
IT0505
Available
Detail Information
Series Title
-
Call Number
004/MIS/IT0505
Publisher
New Delhi : PHI Learning Private Limited.,
Collation
-
Language
English
ISBN/ISSN
978-81-203-268-3
Classification
NONE
Content Type
-
Media Type
-
Carrier Type
-
Edition
Third Edition
Subject(s)
IT
Computer Science
Specific Detail Info
-
Statement of Responsibility
Other version/related

No other version available

File Attachment
No Data
Comments
You must be logged in to post a comment