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.

From the Back Cover:

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

"About this title" may belong to another edition of this title.

Store Description

There's nothing better to clear the cobwebs of the Grumps than curling up with a good book! Find thousands of good reads and lighten your mood with Grumpy's Fine Books!

Visit Seller's Storefront

Seller's business information

Grumpys Fine Books
NM, U.S.A.

Terms of Sale:

I accept all returns within 30 days of delivery and will provide prepaid return shipping labels upon request.

Shipping Terms:

I charge shipping to cover USPS Media Mail rate, unless Priority Mail is chosen. Those items will be shipped via USPS Priority Mail. I do not offer UPS or Fedex shipment at this time.
All items are packaged in the most secure way possible so as to avoid damage in transit.

Payment Methods
accepted by seller

Add to Wants

Items related to Languages and Machines: An Introduction to the Theory...

Languages and Machines: An Introduction to the Theory of Computer Science (3rd Edition)

Sudkamp, Thomas A.

New - Soft cover

Seller's business information