Introduction to Computer Theory

ISBN-10: 0471137723

ISBN-13: 9780471137726

Edition: 2nd 1997 (Revised)

List price: $227.95 Buy it from $21.71
This item qualifies for FREE shipping

*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.

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

Description:

This edition includes revised background material on the history of computing machines, as well as covering context sensitive languages.
New Starting from $240.10
what's this?
Rush Rewards U
Members Receive:
coins
coins
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
Medical Terminology 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
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading

Book details

List price: $227.95
Edition: 2nd
Copyright year: 1997
Publisher: John Wiley & Sons, Incorporated
Publication date: 10/25/1996
Binding: Paperback
Pages: 648
Size: 6.99" wide x 9.94" long x 1.34" tall
Weight: 2.816
Language: English

Automata Theory
Background
Languages
Recursive Definitions
Regular Expressions
Finite Automata
Transition Graphs
Kleene's Theorem
Finite Automata with Output
Regular Languages
Nonregular Languages
Decidability
Pushdown Automata Theory
Context-Free Grammars
Grammatical Format
Pushdown Automata
CFG = PDA
Non-Context-Free Languages
Context-Free Languages
Decidability
Turing Theory
Turing Machines
Post Machines
Minsky's Theorem
Variations on the TM
TM Languages
The Chomsky Hierarchy
Computers
Bibliography
Indexes
×
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.

×