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 and postgraduate students of computer science and
engineering as well as those of the students offering courses in
computer applications.
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!
Welcome to Loot.co.za!
Sign in / Register |Wishlists & Gift Vouchers |Help | Advanced search
