Languages and Machines: An Introduction to the Theory of Computer Science (2nd Edition) - Hardcover

Sudkamp, Thomas A.

Hardcover

ISBN 10: 0201821362 ISBN 13: 9780201821369

Publisher: Addison Wesley, 1996

Synopsis

Languages and Machines gives a mathematically sound presentation of the theory of computing at the junior and senior level, and is an invaluable tool for scientists investigating the theoretical foundations of computer science.
No special mathematical prerequisites are assumed; the theoretical concepts and associated mathematics are made accessible by a "learn as you go" approach that develops an intuitive understanding of the concepts through numerous examples and illustrations.

About this title

Review

Languages and Machines is a user-friendly text that covers the key ideas of the theory of computation clearly and thoroughly. Examples and numerous diagrams, including diagrams that illustrate the principle of induction, aid in the understanding of the material. Relative to other books containing similar information, this text contains in-depth coverage of languages and parsing.

From the Back Cover

No special mathematical prerequisites are assumed; the theoretical concepts and associated mathematics are made accessible by a 'learn as you go' approach that develops an intuitive understanding of the concepts through numerous examples and illustrations. Languages & Machines examines the languages of the Chomsky hierarchy, the grammars that generate them, and the finite automata that accept them. Sections on the Church-Turing thesis and computability theory further examine the development of abstract machines. Computational complexity and NP-completeness are introduced by analyzing the computations of Turing machines. Parsing with LL and LR grammars is included to emphasize language definition and to provide the groundwork for the study of compiler design.

Features

• A winning writing style, Languages and Machines is becoming recognized as an instructor's boon
• Effective examples that convey challenging and complex theoretical concepts
• Numerous diagrams illustrating pictorially the underlying concepts
• Step-by-step, unhurried proofs
• A "learn as you go" approach that develops mathematical sophistication

Features New to this Edition:

• DFA minimization
• Rice's Theorem
• Increased coverage of computational complexity
• Additional examples throughout
• Over 150 additional exercises

** Instructor's materials are available from your sales rep. If you do not know your local sales representative, please call 1-800-552-2499 for assistance, or use the Addison Wesley Longman rep-locator at http://hepg.awl.com/rep-locator.

0201821362B04062001

Edition details

• Publisher: Addison Wesley
• Publication date: 1996
• ISBN 10: 0201821362
• ISBN 13: 9780201821369
• Binding: Hardcover
• Language: English
• Edition number: 2
• Number of pages: 569