This is the long awaited Second Edition of Lewis and Papadimitriou’s best-sellign theory of computation txt. In this substantially modified edition, the authors have enhanced the clarity of their presentation by making the materialmore accessible to a broader undergraduate audience with no specialmathematical experience. For example, long proofs have been simplified and / or truncated, withtheir more technical points delegated to exercises, advanced material is presented in an informal and friendly manner, and problems follow each section to check student comprehension. The book continues to comprise a mathematically sound introduction to the classical and contemporary theory of computation, and provide deep insights into the fundamental paradigms of computer science.
Major assets of the Second Edition:
The concept of algorithm and its analysis are introduced informally in Chapter 1 and are pursued throughout the text. This material will assist theoryof computation courses in which some exposure to algorithms is important.
Automata are studied in the context of their applications, and always in conjunction with the algorithmic problems they pose. State minimization, string matching, LL(1) and bottom-up parsing, and the Myhill-Nerode Theorem are discussed extensively.
Chomsky normal form and the resulting dynamic programming algorithm are presented in the context-free language chapter. Regarding deterministic context-free languages, closure under complement is actually proved.
The Turning machine notation is introduced more informally. Simulations between machine models are analyzed quantitatively. A model of random access Turing machines, similar to RAMs, is introduced and analyzed.
General grammars, µ - recursive functions, and some recursion theory are succinctly introduced in Chapters 4 and 5. Random access Turning machines bridge the “credibility gap” between the elegant simplicity of the Turning machines model and the power of the empirical concept of a computer algorithm.
Complexity starts with a proof that there are intractable problems solvable in exponential time. Easy and hard combinatorial problems, including variants of satisfiability, are introduced, analyzed, and their apparent complexities are contrasted. The intuitions of languages and computational problems are merged smoothly.
A completely new and pedagogically appealing suite of NP-completeness reductions appear in a separate chapter that encompasses the state minimization problem of nondeterministic finite automata, thus coming full circle back to the first topic of the book.
|Packing Weight||0.75 kg|
Categories: Software & Programming
ELEMENTS OF THE THEORY OF COMPUTATION reviews
Be the first to write a review of this product!