Theory of Computation: Formal Languages, Automata and Complexity / Edition 1

Paperback (Print)
Rent
Rent from BN.com
$66.93
(Save 48%)
Eligible for FREE SHIPPING details
Usually ships within 24 hours details
Est. Return Date: 07/17/2013
FREE return shipping at the end of rental period How Textbook Rentals Work
Buy New
Buy New from BN.com
$110.34
(Save 13%)
Used and New from Other Sellers
Used and New from Other Sellers
from $29.46
Usually ships in 1-2 business days
(Save 76%)
Other sellers (Paperback)
  • All (10) from $29.46   
  • New (6) from $98.69   
  • Used (4) from $29.46   

More About This Textbook

Overview

This book presents the foundations of theoretical computer science in a format accessible to undergraduate computer science students. Designed to serve as a text for a one-semester introductory course in the theory of computation, the book covers the traditional topics of formal languages, automata, computability, and computational complexity. In his book, Glenn Brookshear encourages students to appreciate the theoretical ideas as the foundation on which real problems are solved, rather than viewing them as unuseable abstractions. Theory of Computation covers regular, context-free, and general phrase-structure languages along with their associated automata, computability in the context of Turing machines, partial recursive functions and simple programming languages, and complexity theory with an introduction to some of the open classification problems relating to the classes P and NP.

0805301437B04062001

Read More Show Less

Product Details

Meet the Author

J. Glenn Brookshear is an Associate Professor at Marquette University. He received his Ph.D. from New Mexico State University in 1975, then was hired by Marquette to build a strong Computer Science curriculum. In addition to his highly successful Computer Science: An Overview, Brookshear has authored Theory of Computation: Formal Languages, Automata, and Complexity, also published by Addison-Wesley.

0805301437AB04062001

Read More Show Less

Table of Contents

Preliminaries.

Review of Set Theory.

Grammatical Basis of Language Translation.

Historical Background.

Preview of the Remaining Text.

Chapter Review Problems.

Finite Automata and Regular Languages.

Lexical Analysis.

Deterministic Finite Automata.

The Limits of Deterministic Finite Automata.

Nondeterministic Finite Automata.

Regular Grammars.

Regular Expressions.

Closing Comments.

Chapter Review Problems.

Pushdown Automata and Context-Free Languages.

Pushdown Automata.

Context-Free Grammars.

The Limits of Pushdown Automata.

LL(k) Parsers.

LR(k) Parsers.

Turing Machines and Phase-Structure Languages.

Turing Machines.

Modular Construction of Turing Machines.

Turing Machines as Language Accepters.

Turing-Acceptable Languages.

Beyond Phrase-Structure Languages.

Closing Comments.

Chapter Review Problems.

Computability.

Foundations of Recursive Function Theory.

The Scope of Primitive Recursive Functions.

Partial Recursive Functions.

The Power of Programming Languages.

Closing Comments.

Chapter Review Problems.

Complexity.

Computations.

The Complexity of Algorithms.

The Complexity of Problems.

Time Complexity of Language Recognition Problems.

Time Complexity of Nondeterministic Machines.

Closing Comments.

Chapter Review Problems.

Appendices.

A. More About Constructing LR(1) Parse Tables.

B. More About Ackerman's Function.

C. Some Important Unsolvable Problems.

D. On the Complexity of the String Comparison Problem.

E. A Sampling of NP Problems.

Additional Reading. 0805301437T04062001

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:

Review Guidelines
Add Recommendations
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)