An Introduction To Formal Languages And Automata / Edition 4

Hardcover (Print)
Rent
Rent from BN.com
$81.31
(Save 59%)
Est. Return Date: 10/29/2014
Buy Used
Buy Used from BN.com
$127.85
(Save 34%)
Item is in good condition but packaging may have signs of shelf wear/aging or torn packaging.
Condition: Used – Good details
Used and New from Other Sellers
Used and New from Other Sellers
from $3.94
Usually ships in 1-2 business days
(Save 97%)
Other sellers (Hardcover)
  • All (14) from $3.94   
  • New (5) from $55.50   
  • Used (9) from $3.94   

Overview

Fully revised, the new Fourth Edition of An Introduction to Formal Languages and Automata provides an accessible, student-friendly presentation of all material essential to an introductory Theory of Computation course. The text was designed to familiarize students with the foundations and principles of computer science and to strengthen the students' ability to carry out formal and rigorous mathematical arguments. In the new Fourth Edition, author Peter Linz has offered a straightforward, uncomplicated treatment of formal languages and automata and avoids excessive mathematical detail so that students may focus on and understand the underlying principles. In an effort to further the accessibility and comprehension of the text, the author has added new illustrative examples throughout.

Read More Show Less

Product Details

  • ISBN-13: 9780763737986
  • Publisher: Jones & Bartlett Learning
  • Publication date: 2/17/2006
  • Edition description: 4E
  • Edition number: 4
  • Pages: 415
  • Product dimensions: 7.60 (w) x 9.30 (h) x 1.10 (d)

Table of Contents

1 Introduction to the Theory of Computation 1
2 Finite Automata 37
3 Regular Languages and Regular Grammars 73
4 Properties of Regular Languages 101
5 Context-Free Languages 129
6 Simplification of Context-Free Grammars and Normal Forms 155
7 Pushdown Automata 181
8 Properties of Context-Free Languages 211
9 Turing Machines 229
10 Other Models of Turing Machines 257
11 A Hierarchy of Formal Languages and Automata 285
12 Limits of Algorithmic Computation 311
13 Other Models of Computation 337
14 An Introduction to Computational Complexity 257
References for Further Reading 372
Index 373
Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

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
Sort by: Showing all of 2 Customer Reviews
  • Anonymous

    Posted November 19, 2007

    Not good at all unless you already know the subject matter

    This is one of the worst text books that I have used. It gives large amounts of problems to solve, but provides few examples that adequately help the user to solve those problems. It makes references, in examples, to exercises that it assumes you have completed. It doesn't provide many answers to these exercises, either. I would estimate about 10%, and the exercises referred to by the text are usually not part of this 10%. The book does not go into great detail in illustrating a point. I suppose it would be a good reference for someone who already understands the subject matter. For new students, this book is definitely not recommended.

    Was this review helpful? Yes  No   Report this review
  • Anonymous

    Posted January 24, 2009

    No text was provided for this review.

Sort by: Showing all of 2 Customer Reviews

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