L'édition de cet ISBN n'est malheureusement plus disponible.
Afficher les exemplaires de cette édition ISBNLanguages 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** 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.
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.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Frais de port :
EUR 45
De Allemagne vers Etats-Unis
Description du livre paperback. Etat : Akzeptabel. Auflage: 3. 672 Seiten dieselbe ISBN-anderes Cover, Knick am Cover, Buch ist durch Druckstellen stark verlagert (längs durchgebogen), kleine Lagerspuren am Buch, Inhalt einwandfrei und ungelesen 232868 Titel Sprache: Englisch Gewicht in Gramm: 940. N° de réf. du vendeur 211236
Description du livre Etat : Used - Good. N° de réf. du vendeur 9780321315342
Description du livre Etat : Muy Bueno / Very Good. N° de réf. du vendeur 100000000853511