Skip to content
Cart (0) Free shipping over $35*
Buybacks (0) Free shipping on buybacks
loading
Help Contact
Return rental ›

Introduction to Formal Languages, Computability and Complexity

Best in textbook rentals since 2012!

ISBN-10: 0805301437

ISBN-13: 9780805301434

Edition: 1989

Authors: J. Glenn Brookshear

List price: $153.32
Blue ribbon 30 day, 100% satisfaction guarantee!
Marketplace
1 new & used from $10.34
what's this?
Rush Rewards U
Members Receive:
Carrot Coin icon
XP icon
You have reached 400 XP and carrot coins. That is the daily max!

Customers also bought

Book details

List price: $153.32
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.496

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
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
  • TextbookRush.com BBB Business Review
  • Trustpilot
Like TextbookRush on Facebook Follow TextbookRush on X Follow TextbookRush on Instagram Subscribe to TextbookRush on YouTube Follow TextbookRush on Pinterest Add TextbookRush on Snapchat Add TextbookRush on TikTok
© 2002-2024 TextbookRush
Subscribe