Introduction to Automata Theory, Languages, and Computation
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Home > Computing and Information Technology > Computer science > Mathematical theory of computation > Introduction to Automata Theory, Languages, and Computation: International Edition
Introduction to Automata Theory,  Languages, and Computation: International Edition

Introduction to Automata Theory, Languages, and Computation: International Edition


     0     
5
4
3
2
1



Out of Stock


Notify me when this book is in stock
X
About the Book

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.

Table of Contents:
Table of Contents Chapter 1 - Automata: The Methods and the Madness 1.1 Why Study Automata Theory 1.2 Introduction to Formal Proof 1.3 Additional Forms of Proof 1.4 Inductive Proofs 1.5 The Central Concepts of Automata Theory 1.6 Summary of Chapter 1 1.7 Gradiance Problems for Chapter 1 1.8 References for Chapter 1   Chapter 2 - Finite Automata 2.1 An Informal Picture of Finite Automata 2.2 Deterministic Finite Automata 2.3 Nondeterministic Finite Automata 2.4 An Application_ Text Search 2.5 Finite Automata With EpsilonTransitions 2.6 Summary of Chapter 2 2.7 Gradiance Problems for Chapter 2 2.8 References for Chapter 2   Chapter 3 - Regular Expressions and Languages 3.1 Regular Expressions 3.2 Finite Automata and Regular Expressions 3.3 Applications of Regular Expressions 3.4 Algebraic Laws for Regular Expressions 3.5 Summary of Chapter 3 3.6 Gradiance Problems for Chapter 3 3.7 References for Chapter 3   Chapter 4 - Properties of Regular Languages 4.1 Proving Languages Not to Be Regular 4.2 Closure Properties of Regular Languages 4.3 Decision Properties of Regular Languages 4.4 Equivalence and Minimization of Automata 4.5 Summary of Chapter 4 4.6 Gradiance Problems for Chapter 4 4.7 References for Chapter 4   Chapter 5 — Context-Free Grammars and Languages 5.1 Context-Free Grammars 5.2 Parse Trees 5.3 Applications of Context-Free Grammars 5.4 Ambiguity in Grammars and Languages 5.5 Summary of Chapter 5 5.6 Gradiance Problems for Chapter 5 5.7 References for Chapter 5   Chapter 6 - Pushdown Automata 6.1 Definition of the Pushdown Automaton 6.2 The Languages of a PDA 6.3 Equivalence of PDA’s and CFG’s 6.4 Deterministic Pushdown Automata 6.5 Summary of Chapter 6 6.6 Gradiance Problems for Chapter 6 6.7 References for Chapter 6   Chapter 7 - Properties of Context-Free Languages 7.1 Normal Forms for Context-Free Grammars 7.2 The Pumping Lemma for Context-Free Languages 7.3 Closure Properties of Context-Free Languages 7.4 Decision Properties of CFL’s 7.5 Summary of Chapter 7 7.6 Gradiance Problems for Chapter 7 7.7 References for Chapter 7   Chapter 8 - Introduction to Turing Machines 8.1 Problems That Computers Cannot Solve 8.2 The Turing Machine 8.3 Programming Techniques for Turing Machines 8.4 Extensions to the Basic Turing Machine 8.5 Restricted Turing Machines 8.6 Turing Machines and Computers 8.7 Summary of Chapter 8 8.8 Gradiance Problems for Chapter 8 8.9 References for Chapter 8   Chapter 9 - Undecidability 9.1 A Language That Is Not Recursively Enumerable 9.2 An Undecidable Problem That Is RE 9.3 Undecidable Problems About Turing Machines 9.4 Post’s Correspondence Problem 9.5 Other Undecidable Problems 9.6 Summary of Chapter 9 9.7 Gradiance Problems for Chapter 9 9.8 References for Chapter 9   Chapter 10 - Intractable Problems 10.1 The Classes P and NP 10.2 An NP-Complete Problem 10.3 A Restricted Satisfiability Problem 10.4 Additional NP-Complete Problems 10.5 Summary of Chapter 10 10.6 Gradiance Problems for Chapter 10 10.7 References for Chapter 10   Chapter 11 - Additional Classes of Problems 11.1 Complements of Languages in NP 11.2 Problems Solvable in Polynomial Space 11.3 A Problem That Is Complete for PS 11.4 Language Classes Based on Randomization 11.5 The Complexity of Primality Testing 11.6 Summary of Chapter 11 11.7 Gradiance Problems for Chapter 11 11.8 References for Chapter 11   Index  


Best Sellers


Product Details
  • ISBN-13: 9780321514486
  • Publisher: Pearson Education (US)
  • Publisher Imprint: Pearson
  • Height: 164 mm
  • No of Pages: 535
  • Sub Title: International Edition
  • Width: 234 mm
  • ISBN-10: 0321514483
  • Publisher Date: 10 May 2007
  • Binding: SA
  • Language: English
  • Spine Width: 25 mm
  • Weight: 762 gr


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Introduction to Automata Theory,  Languages, and Computation: International Edition
Pearson Education (US) -
Introduction to Automata Theory, Languages, and Computation: International Edition
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Introduction to Automata Theory, Languages, and Computation: International Edition

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    Fresh on the Shelf


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!