Theory of computer science : Automata, languages and computation

By:

Mishra, K. L. P

Contributor(s):

Chandrasekaran, N

Material type: Text

TextLanguage: ENG Publication details: Delhi: PHI Learning Pvt. Ltd., c2024Edition: 3rd edDescription: xiii, 422p. : ill, pbk. ; 24cmISBN:

9788120329683

Subject(s):

Computer Science

DDC classification:

004 MIS 23rd

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. Also includes illustrations and index.

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Call number	Status	Date due	Barcode
Books	Vigyanpuri Campus	004 MIS (Browse shelf(Opens below))	Available		007262

Browsing Vigyanpuri Campus shelves Close shelf browser (Hides shelf browser)

Previous		No cover image available						Next
Previous	003.54 NIE Algebric Geometry in Coding and Cryptography	003.857 GLE Chaos: Making a New Science	003.857 GLE/C Chaos: making a new science/	004 MIS Theory of computer science : Automata, languages and computation	004 RAJ Fundamentals of computers	004.092 PAU/L Last lecture /	004.092 PAU/L Last lecture /	Next

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.

Also includes illustrations and index.

There are no comments on this title.

to post a comment.