Addison-Wesley / Prentice Hall
Computer Science
Browse available resources for Computer Science:
- Select a resource
- Resources for Computer Science GOAL where virtual office hours are 24/7! Your Own TA, Just a Click Away! Deitel Resource Centers View material from Search Engines: Information Retrieval in Practice VideoNotes Andrew Tanenbaum Flame Award Recipient Custom Programs Instructor Resource Center myPearsonStore
ISBN-10: 020102988X
ISBN-13: 9780201029888
Publisher: Addison-Wesley
Copyright: 1979
Format: Paper; 500 pp
Available on Demand
Suggested retail price: $64.20
Not available for purchase at this time.
This book presents automata theory, formal languages, and computational complexity as a coherent theory. It includes end-of-chapter questions, bibliographies, and exercises. Problems of highest and intermediate difficulty are marked respectively with double or single stars.
Preliminaries.
Finite Automata and Regular Expressions.
Properties of Regular Sets.
Context-Free Grammars.
Pushdown Automata.
Properties of Context-Free Languages.
Turing Machines.
Undecideability.
The Chomsky Hierarchy.
Deterministic Context-Free Languages.
Closure Properties of Families of Languages.
Computational Complexity Theory.
Intractable Problems.
Highlights of Other Important Language Classes.
Bibliography.
Index.
Introduction to Automata Theory, Languages, and Computation, 3/E
Hopcroft, Motwani & Ullman
© 2007 | Addison-Wesley | Cloth Package | Instock
ISBN-10: 0321462254 | ISBN-13: 9780321462251
Brief Description | Buy from myPearsonStore
This classic book on formal languages, automata theory, and computational complexity has been updated to present theoretical concepts in a concise and straightforward manner with the increase of hands-on, practical applications. This new edition comes with Gradiance, an online assessment tool developed for computer science.
Gradiance is the most advanced online assessment tool developed for the computer science discipline. With its innovative underlying technology, Gradiance turns basic homework assignments and programming labs into an interactive learning experience for students. By using a series of “root questions” and hints, it not only tests a student’s capability, but actually simulates a one-on-one teacher-student tutorial that allows for the student to more easily learn the material. Through the programming labs, instructors are capable of testing, tracking, and honing their students’ skills, both in terms of syntax and semantics, with an unprecedented level of assessment never before offered.
For more information about Gradiance, please visit www.aw.com/gradiance.
This book presents automata theory, formal languages, and computational complexity as a coherent theory. It includes end-of-chapter questions, bibliographies, and exercises. Problems of highest and intermediate difficulty are marked respectively with double or single stars.
020102988XB04062001
Pearson Higher Education offers special pricing when you choose to package your text with other student resources. If you're interested in creating a cost-saving package for your students, contact your Pearson Higher Education representative for pricing and ordering information.
Pearson Higher Education offers special pricing when you choose to package your text with other student resources. If you're interested in creating a cost-saving package for your students contact your Pearson Higher Education representative.