Hebt u iets om te verkopen?

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

Objectstaat:
Redelijk
Prijs:
US $19,14
OngeveerEUR 17,92
Verzendkosten:
Gratis Voordelige verzendservice. Details bekijkenvoor verzending
Bevindt zich in: Dayton, Ohio, Verenigde Staten
Levering:
Geschatte levering tussen wo, 26 jun en do, 27 jun tot 43230
De levertijd wordt geschat met onze eigen methode op basis van onder meer de nabijheid van de koper ten opzichte van de objectlocatie, de geselecteerde verzendservice, en de verzendgeschiedenis van de verkoper. De leveringstermijnen kunnen variëren, vooral gedurende piekperiodes.
Retourbeleid:
30 dagen om te retourneren. Koper betaalt voor retourzending. Details bekijken- voor meer informatie over retourzendingen
Betalingen:
     

Winkel met vertrouwen

Geld-terug-garantie van eBay
Ontvang het object dat u hebt besteld of krijg uw geld terug. 

Verkopergegevens

Ingeschreven als zakelijke verkoper
De verkoper neemt de volledige verantwoordelijkheid voor deze aanbieding.
eBay-objectnummer:186126248755
Laatst bijgewerkt op 22 jun 2024 17:07:41 CESTAlle herzieningen bekijkenAlle herzieningen bekijken

Specificaties

Objectstaat
Redelijk: Een boek dat slijtage vertoont. De kaft kan enigszins beschadigd zijn, maar is als geheel ...
Release Year
2005
Book Title
Languages and Machines: An Introduction to the Theory of Compu...
ISBN
9780321322210
Subject Area
Computers
Publication Name
Languages and Machines : an Introduction to the Theory of Computer Science
Publisher
Addison Wesley
Item Length
9 in
Subject
Programming Languages / General, Information Theory, Computer Science
Publication Year
2005
Type
Textbook
Format
Trade Paperback
Language
English
Item Height
1.5 in
Author
Thomas A. Sudkamp
Features
Revised
Item Weight
33.6 Oz
Item Width
6.5 in
Number of Pages
672 Pages

Over dit 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

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

Dimensions

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

Additional Product Features

Edition Number
3
LCCN
2004-030342
Dewey Edition
22
Target Audience
College Audience
Illustrated
Yes
Dewey Decimal
511.3
Edition Description
Revised Edition
Lc Classification Number
Qa267.3.S83 2005
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

Objectbeschrijving van de verkoper

Murfbooks

Murfbooks

98% positieve feedback
28K objecten verkocht

Gedetailleerde verkopersbeoordelingen

Gemiddelde van de afgelopen 12 maanden

Nauwkeurige beschrijving
4.9
Redelijke verzendkosten
5.0
Verzendtijd
5.0
Communicatie
5.0
Ingeschreven als zakelijke verkoper

Feedback verkoper (5.989)

v***8 (3567)- Feedback gegeven door koper.
Afgelopen maand
Geverifieerde aankoop
Thank you so much for the Jen Turano book!
r***e (4)- Feedback gegeven door koper.
Afgelopen maand
Geverifieerde aankoop
Item was delivered in good shape with no noticeable damage and in a reasonable timeframe. This was a good experience and I would purchase from this seller again.
a***m (343)- Feedback gegeven door koper.
Afgelopen maand
Geverifieerde aankoop
GOOD!