Can I read Theory of Computer Science: Automata, Languages and Computation, 3rd Edition on EtoBox?

Theory of Computer Science: Automata, Languages and Computation, 3rd Edition by K. L. P. Mishra, N. CHANDRASEKARAN is a nonfiction available to read on EtoBox.

What is Theory of Computer Science: Automata, Languages and Computation, 3rd Edition about?

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. Features new to this edition are: 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; 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; and detailed solutions at the end of the book to chapter-end exercises. The book is designed to meet the needs of the undergraduate an

Who reads Theory of Computer Science: Automata, Languages and Computation, 3rd Edition?

Author

K. L. P. Mishra, N. CHANDRASEKARAN

Publisher

Prentice-Hall of India (Private), Limited

Published

2010

Language

EN

ISBN

9780849390487

Category

nonfiction

Subjects

Science, Technology, Chemistry

Rating

4 / 5 (67 ratings)

Updated

2026-03-13