Elements of the theory of computation
|責任表示||Harry R. Lewis, Christos H. Papadimitriou|
|出版者||Upper Saddle River, N.J. : Prentice-Hall|
|大きさ||361 p. : ill. ; 25 cm|
|概要||As with the 1973 edition, Lewis (computer science, Harvard U.) and Papadamitriou (computer science, U. of California, Berkeley) provide an undergraduate text introducing the classical and contemporary...theory of computation. While the treatment is mathematical, the viewpoint is that of computer science. Taking into account the generations of changes in computer science in the interim, their treatment of Turing machines, algorithm analysis, NP-completeness, and finite automata have been revised. Other topics covered are: sets, relations, and languages; context-free languages; undecidability; and computational complexity. Annotation c. by Book News, Inc., Portland, Or.
Lewis and Papadimitriou present this long awaited Second Edition of their best-selling theory of computation. The authors are well-known for their clear presentation that makes the material accessible to a a broad audience and requires no special previous mathematical experience. In this new edition, the authors incorporate a somewhat more informal, friendly writing style to present both classical and contemporary theories of computation. Algorithms, complexity analysis, and algorithmic ideas are introduced informally in Chapter 1, and are pursued throughout the book. Each section is followed by problems. 続きを見る
|一般注記||Includes bibliographical references and index|
|著者標目||*Lewis, Harry R.
Papadimitriou, Christos H.
|件 名||LCSH:Machine theory
LCSH:Logic, Symbolic and mathematical
: [pbk.] ; ISBN:0132727412