Image from Google Jackets

Theory of Computer Science: Automata, Languages and Computation

By: By: Publication details: New Delhi: Prentice Hall of India, 2022Edition: 3rd edDescription: 422ISBN:
  • 9788120329683
Subject(s): DDC classification:
  • 004.01 MIS
Summary: 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 – 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 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. 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.
List(s) this item appears in: New Arrivals for the Month of November - 2023
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Collection Call number Copy number Status Date due Barcode Item holds
Book Book Alliance College of Engineering and Design CSE & IT 004.01 MIS (Browse shelf(Opens below)) Available E12781
Book Book Alliance College of Engineering and Design CSE & IT 004.01 MIS (Browse shelf(Opens below)) Available E12780
Book Book Alliance College of Engineering and Design CSE & IT 004.01 MIS (Browse shelf(Opens below)) Available E12784
Book Book Alliance College of Engineering and Design CSE & IT 004.01 MIS (Browse shelf(Opens below)) Available E12782
Book Book Alliance College of Engineering and Design SC & ST Book Bank - Mezzanine Floor CSE & IT 004.01 MIS (Browse shelf(Opens below)) Available E12783
Reference Book Reference Book Alliance College of Engineering and Design CSE & IT 004.01 MIS (Browse shelf(Opens below)) 1 Not for loan E11232
Book Book Alliance College of Engineering and Design CSE & IT 004.01 MIS (Browse shelf(Opens below)) 2 Available E11233
Book Book Alliance College of Engineering and Design CSE & IT 004.01 MIS (Browse shelf(Opens below)) 5 Available E11236
Book Book Alliance College of Engineering and Design CSE & IT 004.01 MIS (Browse shelf(Opens below)) 3 Available E11234
Book Book Alliance College of Engineering and Design CSE & IT 004.01 MIS (Browse shelf(Opens below)) 4 Available E11235
Total holds: 0

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 – 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 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.

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.

There are no comments on this title.

to post a comment.