Languages And Machines: An Introduction To The Theory Of Computer Science: An Introduction to the Theory of Computer Science: United States Edition

Sudkamp Thomas, A.:

ISBN 10: 0321322215 / ISBN 13: 9780321322210

Edité par Pearson, 2005

A propos de cet article

Seiten; 9780321322210.4 Gewicht in Gramm: 2.

N° de réf. du vendeur 732632

Détails bibliographiques

• Titre: Languages And Machines: An Introduction To The Theory Of Computer Science: An Introduction to the Theory of Computer Science: United States Edition
• Éditeur: Pearson
• Date de parution: 2005
• Langue: anglais
• ISBN à 10 chiffres: 0321322215
• ISBN à 13 chiffres: 9780321322210
• Reliure: paperback
• Édition: 3ème Édition
• État de l'article: Befriedigend
• Catalogues du vendeur:
  • Varia

A propos de ce titre

Synopsis

 

The third edition of Languages and Machines: An Introduction to the Theory of Computer Science provides readers with a mathematically sound presentation of the theory of computer science at a level suitable for junior and senior level computer science majors.  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.  In this edition the presentation has been enhanced by increasing the number of examples, expanding the selection of topics particularly in the area of computational complexity, and providing a flexible format giving instructors the ability to design their courses that concentrate on specific areas such as automata theory, computability theory, or computational complexity.

Quatrième de couverture

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. Topics covered include the theory of formal languages and automata, computability, computational complexity, and deterministic parsing of context-free languages.

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