Languages and Machines: An Introduction to the Theory of Computer Science - Couverture souple

Sudkamp, Thomas A.

Couverture souple

ISBN 10 : 0201157683 ISBN 13 : 9780201157680

Editeur : Addison Wesley, 1988

Synopsis

A presentation of the theory of computing, including coverage of the theory of formal languages and automata, compatability, computational complexity, and deterministic parsing of context-free languages.

A propos du livre

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

Présentation de l'éditeur

Languages and Machines, which is intended for computer scientists in the theoretical foundations of their subject, gives a mathematically sound presentation of the theory of computing at the junior and senior level. Topics covered include the theory of formal languages and automata, computability, computational complexity, and deterministic parsing of context-free languages. To make these topics accessible to the undergraduate, no special mathematical prerequisites are assumed. The author examines the languages of the Chomsky hierarchy, the grammars that generate them, and the finite automata that accept them. The development of abstract machines continues with the Church-Turing thesis and computability theory. 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. The second edition now includes new sections covering equivalence relations, Rice's Theorem, pumping lemma for context-free grammars, the DFA minimization algorithm, and over 150 new exercises and examples.

Détails de l'édition

• Éditeur: Addison Wesley
• Date d'édition: 1988
• Langue: anglais
• ISBN 10: 0201157683
• ISBN 13: 9780201157680
• Reliure: Broché
• Nombre de pages: 608
• Coordonnées du fabricant: non disponible
• Personne responsable: GS1 Slovakia; https://www.gs1sk.org; ; Nantersk� 23; Žilina; 010 08; Slovaquie