Introduction to Automata Theory, Languages, and Computation

by ; ;
  • ISBN13:


  • ISBN10:


  • Edition: 3rd
  • Format: Hardcover
  • Copyright: 6/29/2006
  • Publisher: Pearson
  • View Upgraded Edition

Note: Supplemental materials are not guaranteed with Rental or Used book purchases.

Purchase Benefits

  • Free Shipping On Orders Over $59!
    Your order must be $59 or more to qualify for free economy shipping. Bulk sales, PO's, Marketplace items, eBooks and apparel do not qualify for this offer.
  • Get Rewarded for Ordering Your Textbooks! Enroll Now
  • We Buy This Book Back!
    In-Store Credit: $48.30
    Check/Direct Deposit: $46.00
List Price: $189.00 Save up to $60.48
  • Buy Used
    Add to Cart Free Shipping


Supplemental Materials

What is included with this book?

  • The Used copy of this book is not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.


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 students 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 .

Table of Contents

Automata: The Methods and the Madness
Why Study Automata Theory
Introduction to Formal Proof
Additional Forms of Proof
Inductive Proofs
The Central Concepts of Automata Theory
Summary of Chapter 1
Gradiance Problems for Chapter 1
References for Chapter 1
Finite Automata
An Informal Picture of Finite Automata
Deterministic Finite Automata
Nondeterministic Finite Automata
An Application_ Text Search
Finite Automata With EpsilonTransitions
Summary of Chapter 2
Gradiance Problems for Chapter 2
References for Chapter 2
Regular Expressions and Languages
Regular Expressions
Finite Automata and Regular Expressions
Applications of Regular Expressions
Algebraic Laws for Regular Expressions
Summary of Chapter 3
Gradiance Problems for Chapter 3
References for Chapter 3
Properties of Regular Languages
Proving Languages Not to Be Regular
Closure Properties of Regular Languages
Decision Properties of Regular Languages
Equivalence and Minimization of Automata
Summary of Chapter 4
Gradiance Problems for Chapter 4
References for Chapter 4
Context-Free Grammars and Languages
Context-Free Grammars
Parse Trees
Applications of Context-Free Grammars
Ambiguity in Grammars and Languages
Summary of Chapter 5
Gradiance Problems for Chapter 5
References for Chapter 5
Pushdown Automata
Definition of the Pushdown Automaton
The Languages of a PDA
Equivalence of PDA's and CFG's
Deterministic Pushdown Automata
Summary of Chapter 6
Gradiance Problems for Chapter 6
References for Chapter 6
Properties of Context-Free Languages
Normal Forms for Context-Free Grammars
The Pumping Lemma for Context-Free Languages
Closure Properties of Context-Free Languages
Decision Properties of CFL's
Summary of Chapter 7
Gradiance Problems for Chapter 7
References for Chapter 7
Introduction to Turing Machines
Problems That Computers Cannot Solve
The Turing Machine
Programming Techniques for Turing Machines
Extensions to the Basic Turing Machine
Restricted Turing Machines
Turing Machines and Computers
Summary of Chapter 8
Gradiance Problems for Chapter 8
References for Chapter 8
A Language That Is Not Recursively Enumerable
An Undecidable Problem That Is RE
Undecidable Problems About Turing Machines
Post's Correspondence Problem
Other Undecidable Problems
Summary of Chapter 9
Gradiance Problems for Chapter 9
References for Chapter 9
Intractable Problems
The Classes P and NP
An NP-Complete Problem
A Restricted Satisfiability Problem
Additional NP-Complete Problems
Summary of Chapter 10
Gradiance Problems for Chapter 10
References for Chapter 10
Additional Classes of Problems
Complements of Languages in NP
Problems Solvable in Polynomial Space
A Problem That Is Complete for PS
Language Classes Based on Randomization
The Complexity of Primality Testing
Summary of Chapter 11
Gradiance Problems for Chapter 11
References for Chapter 11
Table of Contents provided by Publisher. All Rights Reserved.

Rewards Program

Write a Review