Introduction to Formal Languages, Computability and Complexity

ISBN-10: 0805301437

ISBN-13: 9780805301434

Edition: 1989

List price: $156.40 Buy it from $18.92 Rent it from $24.39
30 day, 100% satisfaction guarantee

If an item you ordered from TextbookRush does not meet your expectations due to an error on our part, simply fill out a return request and then return it by mail within 30 days of ordering it for a full refund of item cost.

Learn more about our returns policy


Used Starting from $18.92
Rent Starting from $24.39
what's this?
Rush Rewards U
Members Receive:
You have reached 400 XP and carrot coins. That is the daily max!

Study Briefs

Limited time offer: Get the first one free! (?)

All the information you need in one place! Each Study Brief is a summary of one specific subject; facts, figures, and explanations to help you learn faster.

Add to cart
Study Briefs
Periodic Table Online content $4.95 $1.99
Add to cart
Study Briefs
Calculus 1 Online content $4.95 $1.99
Add to cart
Study Briefs
SQL Online content $4.95 $1.99
Add to cart
Study Briefs
MS Excel® 2010 Online content $4.95 $1.99

Customers also bought


Book details

List price: $156.40
Copyright year: 1989
Publisher: Addison Wesley
Publication date: 1/1/1989
Binding: Hardcover
Pages: 320
Size: 7.75" wide x 9.00" long x 0.50" tall
Weight: 1.804

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.
Foundations of Recursive Function Theory
The Scope of Primitive Recursive Functions
Partial Recursive Functions
The Power of Programming Languages
Closing Comments
Chapter Review Problems
The Complexity of Algorithms
The Complexity of Problems
Time Complexity of Language Recognition Problems
Time Complexity of Nondeterministic Machines
Closing Comments
Chapter Review Problems
More About Constructing LR(1) Parse Tables
More About Ackerman's Function
Some Important Unsolvable Problems
On the Complexity of the String Comparison Problem
A Sampling of NP Problems
Additional Reading
Free shipping on orders over $35*

*A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.

Learn more about the TextbookRush Marketplace.