|Listed in category:
Have one to sell?

Languages and Machines: An Introduction to the Theory of Computer Science (3...

US $22.81
Condition:
Acceptable
Breathe easy. Returns accepted.
Shipping:
Free Economy Shipping. See detailsfor shipping
Located in: Dayton, Ohio, United States
Delivery:
Estimated between Thu, May 30 and Sat, Jun 1 to 43230
Delivery time is estimated using our proprietary method which is based on the buyer's proximity to the item location, the shipping service selected, the seller's shipping history, and other factors. Delivery times may vary, especially during peak periods.
Returns:
30 days returns. Buyer pays for return shipping. See details- for more information about returns
Payments:
      
Earn up to 5x points when you use your eBay Mastercard®. Learn moreabout earning points with eBay Mastercard

Shop with confidence

eBay Money Back Guarantee
Get the item you ordered or your money back. Learn moreeBay Money Back Guarantee - opens new window or tab
Seller assumes all responsibility for this listing.
eBay item number:186126248755
Last updated on May 25, 2024 08:09:40 PDTView all revisionsView all revisions

Item specifics

Condition
Acceptable: A book with obvious wear. May have some damage to the cover but integrity still intact. ...
Release Year
2005
Book Title
Languages and Machines: An Introduction to the Theory of Compu...
ISBN
9780321322210
Publication Name
Languages and Machines : an Introduction to the Theory of Computer Science
Item Length
9in
Publisher
Addison Wesley
Publication Year
2005
Type
Textbook
Format
Trade Paperback
Language
English
Item Height
1.5in
Author
Thomas A. Sudkamp
Features
Revised
Item Width
6.5in
Item Weight
33.6 Oz
Number of Pages
672 Pages

About this product

Product Information

The third edition of "Languages and Machines: An Introduction to the Theory of Computer Science "provides readers with a mathematically sound presentation of the theory of computer science. The theoretical concepts and associated mathematics are made accessible by a "learn as you go" approach that develops an intuitive understanding of the concepts through numerous examples and illustrations.

Product Identifiers

Publisher
Addison Wesley
ISBN-10
0321322215
ISBN-13
9780321322210
eBay Product ID (ePID)
43761294

Product Key Features

Author
Thomas A. Sudkamp
Publication Name
Languages and Machines : an Introduction to the Theory of Computer Science
Format
Trade Paperback
Language
English
Features
Revised
Publication Year
2005
Type
Textbook
Number of Pages
672 Pages

Dimensions

Item Length
9in
Item Height
1.5in
Item Width
6.5in
Item Weight
33.6 Oz

Additional Product Features

Lc Classification Number
Qa267.3.S83 2005
Edition Description
Revised Edition
Edition Number
3
Table of Content
Introduction Part I: Foundations Chapter 1: Mathematical Preliminaries 1.1 Set Theory 1.2 Cartesian Product, Relations, and Functions 1.3 Equivalence Relations 1.4 Countable and Uncountable Sets 1.5 Diagonalization and Self-Reference 1.6 Recursive Definitions 1.7 Mathematical Induction 1.8 Directed Graphs Exercises Bibliographic Notes Chapter 2: Languages 2.1 Strings and Languages 2.2 Finite Specification of Languages 2.3 Regular Sets and Expressions 2.4 Regular Expressions and Text Searching Exercises Bibliographic Notes Part II: Grammars, Automata, and Languages Chapter 3: Context-Free Grammars 3.1 Context-Free Grammars and Languages 3.2 Examples of Grammars and Languages 3.3 Regular Grammars 3.4 Verifying Grammars 3.5 Leftmost Derivations and Ambiguity 3.6 Context-Free Grammars and Programming Language Definition Exercises Bibliographic Notes Chapter 4: Normal Forms for Context-Free Grammars 4.1 Grammar Transformations 4.2 Elimination of Rules 4.3 Elimination of Chain Rules 4.4 Useless Symbols 4.5 Chomsky Normal Form 4.6 The CYK Algorithm 4.7 Removal of Direct Left Recursion 4.8 Greibach Normal Form Exercises Bibliographic Notes Chapter 5: Finite Automata 5.1 A Finite-State Machine 5.2 Deterministic Finite Automata 5.3 State Diagrams and Examples 5.4 Nondeterministic Finite Automata 5.5 Transitions 5.6 Removing Nondeterminism 5.7 DFA Minimization Exercises Bibliographic Notes Chapter 6: Properties of Regular Languages 6.1 Finite-State Acceptance of Regular Languages 6.2 Expression Graphs 6.3 Regular Grammars and Finite Automata 6.4 Closure Properties of Regular Languages 6.5 A Nonregular Language 6.6 The Pumping Lemma for Regular Languages 6.7 The Myhill-Nerode Theorem Exercises Bibliographic Notes Chapter 7: Pushdown Automata and Context-Free Languages 7.1 Pushdown Automata 7.2 Variations on the PDA Theme 7.3 Acceptance of Context-Free Languages 7.4 The Pumping Lemma for Context-Free Languages 7.5 Closure Properties of Context-Free Languages Exercises Bibliographic Notes Part III: Computability Chapter 8: Turing Machines 8.1 The Standard Turing Machine 8.2 Turing Machines as Language Acceptors 8.3 Alternative Acceptance Criteria 8.4 Multitrack Machines 8.5 Two-Way Tape Machines 8.6 Multitape Machines 8.7 Nondeterministic Turing Machines 8.8 Turing Machines as Language Enumerators Exercises Bibliographic Notes Chapter 9: Turing Computable Functions 9.1 Computation of Functions 9.2 Numeric Computation 9.3 Sequential Operation of Turing Machines 9.4 Composition of Functions 9.5 Uncomputable Functions 9.6 Toward a Programming Language Exercises Bibliographic Notes Chapter 10: The Chomsky Hierarchy 10.1 Unrestricted Grammars 10.2 Context-Sensitive Grammars 10.3 Linear-Bounded Automata 10.4 The Chomsky Hierarchy Exercises Bibliographic Notes Chapter 11: Decision Problems and the Church-Turing Thesis 11.1 Representation of Decision Problems 11.2 Decision Problems and Recursive Languages 11.3 Problem Reduction 11.4 The Church-Turing Thesis 11.5 A Universal Turing Machine Exercises Bibliographic Notes Chapter 12: Undecidability 12.1 The Halting Problem for Turing Machines 12.2 Problem Reduction and Undecidability 12.3 Additional Halting Problem Reductions 12.4 Rice''s Theorem 12.5 An Unsolvable Word Problem 12.6 The Post Correspondence Problem 12.7 Undecidable Problems in Context-Free Grammars Exercises Bibliographic Notes Chapter 13: Mu-Recursive Functions 13.1 Primitive Recursive Functions 13.2 Some Primitive Recursive Functions 13.3 Bounded Operators <p style="MARG
Copyright Date
2006
Target Audience
College Audience
Topic
Programming Languages / General, Information Theory, Computer Science
Lccn
2004-030342
Dewey Decimal
511.3
Dewey Edition
22
Illustrated
Yes
Genre
Computers

Item description from the seller

Murfbooks

Murfbooks

98.1% positive feedback
28K items sold
Joined Dec 2017

Detailed seller ratings

Average for the last 12 months

Accurate description
4.9
Reasonable shipping cost
5.0
Shipping speed
5.0
Communication
5.0

Seller feedback (5,931)

a***l (982)- Feedback left by buyer.
Past 6 months
Verified purchase
Thank You so much! ***5**Stars**Plus! Buyers- I recommend this A++5**Stars**Seller! I am certainly going to 'Save this Seller' for future purchases! Fantastic Book is a treasure for my Library & Malta collection and I started reading it immediately ~ it is in New Condition and packed with care! Great prices, fast shipping!
f***0 (171)- Feedback left by buyer.
Past 6 months
Verified purchase
Great item, exactly as described! Super fast shipping, fair prices, a GREAT EBayer!!! Would definitely buy from them again!! Highly recommended!!! AAAAA+++++
m***l (5108)- Feedback left by buyer.
Past 6 months
Verified purchase
5 star seller - item as described, shipped immediately, well-packed - thank you!

Product ratings and reviews

No ratings or reviews yet
Be the first to write the review.