Languages and Machines An Introduction to the Theory of Computer Science

ISBN-10: 0201821362
ISBN-13: 9780201821369
Edition: 2nd 1997
List price: $113.80
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: "Languages and Machines introduces the foundations of computer science and examines the capabilities and limitations of algorithmic computation. With an expanded selection of topics, the Third Edition features a wealth of examples, illustrations,  More...

what's this?
Rush Rewards U
Members Receive:
coins
coins
You have reached 400 XP and carrot coins. That is the daily max!
You could win $10,000

Get an entry for every item you buy, rent, or sell.

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
Business Ethics Online content $4.95 $1.99
Add to cart
Study Briefs
Business Law Online content $4.95 $1.99
Add to cart
Study Briefs
Management Online content $4.95 $1.99

Customers also bought

Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading

Book details

List price: $113.80
Edition: 2nd
Copyright year: 1997
Publisher: Addison-Wesley Longman, Incorporated
Publication date: 11/4/1996
Binding: Hardcover
Pages: 500
Size: 6.75" wide x 9.75" long x 1.00" tall
Weight: 1.936
Language: English

"Languages and Machines introduces the foundations of computer science and examines the capabilities and limitations of algorithmic computation. With an expanded selection of topics, the Third Edition features a wealth of examples, illustrations, and practical applications alongside the presentation of the theoretical concepts." "This student-friendly, mathematically sound presentation assumes no advanced prerequisites. The flexible design of the text allows instructors to structure their course around formal language and automata theory, computability, computational complexity, or the use of formal languages in programming language definition and parsing."--BOOK JACKET.

Introduction
Foundations
Mathematical Preliminaries
Set Theory
Cartesian Product, Relations, and Functions
Equivalence Relations
Countable and Uncountable Sets
Recursive Definitions
Mathematical Induction
Directed Graphs
Exercises
Bibliographic Notes
Languages
Strings and Languages
Finite Specification of Languages
Regular Sets and Expressions
Exercises
Bibliographic Notes
Context-Free Grammars And Parsing
Context-Free Grammars
Context-Free Grammars and Languages
Examples of Grammars and Languages
Regular Grammars
Grammars and Languages Revisited
A Context-Free Grammar for Pascal
Arithmetic Expressions
Exercises
Bibliographic Notes
Parsing: An Introduction
Leftmost Derivations and Ambiguity
The Graph of a Grammar
A Breadth-First Top-Down Parser
A Depth-First Top-Down Parser
Bottom-Up Parsing
A Shift-Reduce Parser
Exercises
Bibliographic Notes
Normal Forms
Elimination of Lambda Rules
Elimination of Chain Rules
Useless Symbols
Chomsky Normal Form
Removal of Direct Left Recursion
Greibach Normal Form
Exercises
Bibliographic Notes
Automata And Languages
Finite Automata
A Finite-State Machine
Deterministic Finite Automata
State Diagrams and Examples
Nondeterministic Finite Automata
Lambda Transitions
Removing Nondeterminism
DFA Minimization
Exercises
Bibliographic Notes
Regular Languages and Sets
Finite Automata and Regular Sets
Expression Graphs
Regular Grammars & Finite Automata
Closure Properties of Regular Languages
A Nonregular Language
The Pumping Lemma for Regular Languages
Myhill-Nerode Theorem
Exercises
Bibliographic Notes
Pushdown Automata and Context-Free Languages
Variations on the PDA Theme
Pushdown Automaton and Context-Free Languages
The Pumping Lemma for Context-Free Languages
Closure Properties of Context-Free Languages
A Two-Stack Automation
Exercises
Bibliographic Notes
Turing Machines
The Standard Turing Machine
Turing Machines as Language Acceptors
Alternate Acceptance Criteria
Multitrack Machines
Two-Way Tape
Multitape Machines
Nondeterministic Turing Machines
Turing Machines as Language Enumerators
Exercises
Bibliographic Notes
The Chomsky Hierarchy
Unrestricted Grammars
Context-Sensitive Grammars
Linear-Bounded Automata
The Chomsky Hierarchy
Exercises
Bibliographic Notes
Decidability And Computablity
Decidability
Decision Problems
The Church-Turing Thesis
The Halting Problem for Turing Machines
A Universal Machine
Reducibility
Rice''s Theorem
An Unsolvable Word Problem
The Post Correspondence Problem
Undecidable Problems in Context- Free Grammars
Exercises
Bibliographic Notes
Numeric Computation
Computation of Functions
Sequential Operation of Turing Machines
Composition of Functions
Toward a Programming Languages
Exercises
Bibliographic Notes
Mu-Recursive Functions
Primitive Recursive Functions
Some Primitive Recursive Functions
Bounded Operators
Division Functions
G�del Numbering and Course-of-Values Recursion
Computable Partial Functions
Turing Computability and Mu-Recursive Functions
The Church-Turing Thesis Revisited
Exercises
Bibliographic Notes
V
Computational Complexity
Time Complexity of a Turing Machine
Linear Speed-Up
Rates of Growth
Complexity and Turing Machine Variations
Variations of Time Complexity
Nondeterministic Complexity
Space Complexity
Exercises
Bibliographic Notes
Tractability and NP-Complete Problems
Tractable and Intractable Decision Problems
The Class NP
P=NP
The Satisfiability Problem
Additional NP-Complete Problems
Derivative Complexity Classes
Exercises
Bibliographic Notes
Deterministic Parsing
LL (k) Grammars
Lookahead in Context-Free Grammars
First, Follow, and Lookahead Sets
Strong LL (k) Grammars
Construction of FIRSTk Sets
Construction of FOLLOWk Sets
A Strong LL(1) Grammar
A Strong LL(k) Parser
LL(k) Grammars
Exercises
Bibliographic Notes
LR(k) Grammars
LR(0) Contexts
LR(0) Parser
LR(0) Machine
Acceptance by the LR(0) Machine
Acceptance by the LR(p) Machine
LR(1) Grammars
Exercises
Bibliographic
Notes

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

×