Introduction to Languages and the Theory of Computation / Edition 4

Hardcover (Print)
Rent
Rent from BN.com
$41.22
(Save 83%)
Est. Return Date: 11/15/2014
Buy New
Buy New from BN.com
$219.52
Used and New from Other Sellers
Used and New from Other Sellers
from $74.95
Usually ships in 1-2 business days
(Save 69%)
Other sellers (Hardcover)
  • All (7) from $74.95   
  • New (3) from $169.97   
  • Used (4) from $74.95   

Overview

Introduction to Languages and the Theory of Computation helps students make the connection between the practice of computing and an understanding of the profound ideas that defines it. The book's organization and the author's ability to explain complex topics clearly make this introduction to the theory of computation an excellent resource for a broad range of upper level students. The author has learned through many years of teaching that the best way to present theoretical concepts is to take advantage of the precision and clarity of mathematical language. In a way that is accessible to students still learning this language, he presents the necessary mathematical tools gently and gradually which provides discussion and examples that make the language intelligible.

Read More Show Less

Product Details

  • ISBN-13: 9780073191461
  • Publisher: McGraw-Hill Higher Education
  • Publication date: 2/2/2010
  • Edition description: New Edition
  • Edition number: 4
  • Pages: 448
  • Sales rank: 1,081,497
  • Product dimensions: 7.40 (w) x 9.20 (h) x 0.90 (d)

Table of Contents

Preface
Introduction
Pt. I Mathematical Notation and Techniques 1
Ch. 1 Basic Mathematical Objects 3
Ch. 2 Mathematical Induction and Recursive Definitions 43
Pt. II Regular Languages and Finite Automata 83
Ch. 3 Regular Expressions and Finite Automata 85
Ch. 4 Nondeterminism and Kleene's Theorem 123
Ch. 5 Regular and Nonregular Languages 168
Pt. III Context-Free Languages and Pushdown Automata 201
Ch. 6 Context-Free Grammars 203
Ch. 7 Pushdown Automata 251
Ch. 8 Context-Free and Non-Context-Free Languages 297
Pt. IV Turing Machines and Their Languages 317
Ch. 9 Turing Machines 319
Ch. 10 Recursively Enumerable Languages 365
Pt. V Unsolvable Problems and Computable Functions 405
Ch. 11 Unsolvable Problems 407
Ch. 12 Computable Functions 442
Pt. VI Introduction to Computational Complexity 479
Ch. 13 Measuring and Classifying Complexity 481
Ch. 14 Tractable and Intractable Problems 500
References 527
Bibliography 529
Index of Notation 531
Index 535
Read More Show Less

Customer Reviews

Average Rating 5
( 1 )
Rating Distribution

5 Star

(1)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)