StartGroepenDiscussieMeerTijdgeest
Doorzoek de site
Onze site gebruikt cookies om diensten te leveren, prestaties te verbeteren, voor analyse en (indien je niet ingelogd bent) voor advertenties. Door LibraryThing te gebruiken erken je dat je onze Servicevoorwaarden en Privacybeleid gelezen en begrepen hebt. Je gebruik van de site en diensten is onderhevig aan dit beleid en deze voorwaarden.

Resultaten uit Google Boeken

Klik op een omslag om naar Google Boeken te gaan.

Elements of the Theory of Computation…
Bezig met laden...

Elements of the Theory of Computation (Prentice-Hall Software Series) (editie 1981)

door Harry R. Lewis, Christopher Papadimitriou

LedenBesprekingenPopulariteitGemiddelde beoordelingDiscussies
1961137,536 (3.3)Geen
Appropriate for senior and graduate level courses in Computer Science Theory, Automata, and Theory of Computation. This is the long awaited Second Edition of Lewis and Papadimitriou's best-selling theory of computation text. In this substantially modified edition, the authors have enhanced the clarity of their presentation by making the material more accessible to a broader undergraduate audience with no special mathematical experience.… (meer)
Lid:AlkerVirtualLibrary
Titel:Elements of the Theory of Computation (Prentice-Hall Software Series)
Auteurs:Harry R. Lewis
Andere auteurs:Christopher Papadimitriou
Info:Prentice Hall (1981), Hardcover, 496 pages
Verzamelingen:Jouw bibliotheek
Waardering:
Trefwoorden:Geen

Informatie over het werk

Elements of the Theory of Computation door Harry R. Lewis

Geen
Bezig met laden...

Meld je aan bij LibraryThing om erachter te komen of je dit boek goed zult vinden.

Op dit moment geen Discussie gesprekken over dit boek.

Indeholder "Preface", "Chapter 1. Sets, Relations and Languages", " 1.1 "If-Then" and its Relatives", " 1.2 Sets", " 1.3 Relations and Functions", " 1.4 Special Types of Binary Relations", " 1.5 Closures", " 1.6 Finite and Infinite Sets", " 1.7 Three Fundamental Proof Techniques", " 1.8 Alphabets and Languages", " 1.9 Finite Representation of Languages", " Problems", " References", "Chapter 2. Finite Automata", " 2.1 Deterministic Finite Automata", " 2.2 Nondeterministic Finite Automata", " 2.3 Equivalence of Deterministic and Nondeterministic Finite Automata", " 2.4 Properties of the Languages Accepted by Finite Automata", " 2.5 Finite Automata and Regular Expressions", " 2.6 Proofs that Languages Are and Are Not Regular", " Problems", " References", "Chapter 3. Context-Free Languages", " 3.1 Context-Free Grammars", " 3.2 Regular Languages and Context-Free Grammars", " 3.3 Pushdown Automata", " 3.4 Pushdown Automata and Context-Free Grammars", " 3.5 Properties of Context-Free Languages", " 3.5.1 Closure Properties", " 3.5.2 Periodicity Properties", " 3.5.3 Algorithmic Properties", " 3.6 Determinism and Parsing", " 3.6.1 Deterministic Pushdown Automata and Context-Free Languages", " 3.6.2 Top-Down Parsing", " 3.6.3 Bottom-Up Parsing", " Problems", " References", "Chapter 4. Turing Machines", " 4.1 The Definition of a Turing Machine", " 4.2 Computing with Turing Machines", " 4.3 Combining Turing Machines", " 4.4 Some Examples of More Powerful Turing Machines", " 4.5 Extensions of the Turing Machine", " 4.6 Nondeterministic Turing Machines", " Problems", " References", "Chapter 5. Church's Thesis", " 5.1 Church's Thesis", " 5.2 Grammars", " 5.3 The Primitive Recursive Functions", " 5.4 Gödelization", " 5.5 The μ-Recursive Functions", " 5.6 Turing-Computability of the μ-Recursive Functions", " 5.7 Universal Turing Machines", " Problems", " References", "Chapter 6. Uncomputability", " 6.1 The Halting Problem", " 6.2 Turing-Enumerability, Turing-Acceptability, and Turing-Decidability", " 6.3 Unsolvable Problems About Turing Machines and μ-Recursive Functions", " 6.4 Unsolvable Problems About Grammars and Similar Systems", " 6.4.1 Unsolvable Problems About Unrestricted Grammars", " 6.4.2 Thue Systems", " 6.4.3 Post's Correspondence Problem", " 6.4.4 Unsolvable Problems About Context-Free Grammars", " 6.5 An Unsolvable Tiling Problem", " Problems", " References", "Chapter 7. Computational Complexity", " 7.1 Time-Bounded Turing Machines", " 7.2 Rate of Growth of Functions", " 7.3 Time-Bounded Simulations", " 7.4 The Classes P and NP", " 7.5 NP-Completeness", " 7.6 Some NP-Complete Problems", " 7.6.1 A Bounded Tiling Problem", " 7.6.2 Integer Programming", " 7.6.3 The Travelling Salesman Problem", " 7.7 The Complexity Hierarchy", " Problems", " References", "Chapter 8. The Propositional Calculus", " 8.1 Introduction", " 8.2 Syntax of the Propositional Calculus", " 8.3 Truth-Assignments", " 8.4 Validity and Satisfiability", " 8.5 Equivalence and Normal Forms", " 8.6 Compactness", " 8.7 Resolution in the Propositional Calculus", " Problems", "Chapter 9. The Predicate Calculus", " 9.1 The Predicate Calculus: Syntax", " 9.2 Structures and Satisfiability", " 9.3 Equivalence", " 9.4 The Expansion Theorem", " 9.5 Three Applications of the Expansion Theorem", " 9.6 Unsolvability and NP-Completeness", " 9.7 Resolution in the Predicate Calculus", " Problems", " References", "Index".

Udmærket standardlærebog i beregnelighedsteori. ( )
  bnielsen | Mar 6, 2013 |
geen besprekingen | voeg een bespreking toe

» Andere auteurs toevoegen (2 mogelijk)

AuteursnaamRolType auteurWerk?Status
Harry R. Lewisprimaire auteuralle editiesberekend
Papadimitriou, Christos H.AuteurSecundaire auteursommige editiesbevestigd
Je moet ingelogd zijn om Algemene Kennis te mogen bewerken.
Voor meer hulp zie de helppagina Algemene Kennis .
Gangbare titel
Informatie afkomstig uit de Engelse Algemene Kennis. Bewerk om naar jouw taal over te brengen.
Oorspronkelijke titel
Alternatieve titels
Oorspronkelijk jaar van uitgave
Mensen/Personages
Belangrijke plaatsen
Belangrijke gebeurtenissen
Verwante films
Motto
Opdracht
Eerste woorden
Citaten
Laatste woorden
Ontwarringsbericht
Uitgevers redacteuren
Auteur van flaptekst/aanprijzing
Oorspronkelijke taal
Gangbare DDC/MDS
Canonieke LCC

Verwijzingen naar dit werk in externe bronnen.

Wikipedia in het Engels

Geen

Appropriate for senior and graduate level courses in Computer Science Theory, Automata, and Theory of Computation. This is the long awaited Second Edition of Lewis and Papadimitriou's best-selling theory of computation text. In this substantially modified edition, the authors have enhanced the clarity of their presentation by making the material more accessible to a broader undergraduate audience with no special mathematical experience.

Geen bibliotheekbeschrijvingen gevonden.

Boekbeschrijving
Haiku samenvatting

Actuele discussies

Geen

Populaire omslagen

Snelkoppelingen

Waardering

Gemiddelde: (3.3)
0.5
1 1
1.5
2 1
2.5
3 1
3.5 2
4 5
4.5
5

Ben jij dit?

Word een LibraryThing Auteur.

 

Over | Contact | LibraryThing.com | Privacy/Voorwaarden | Help/Veelgestelde vragen | Blog | Winkel | APIs | TinyCat | Nagelaten Bibliotheken | Vroege Recensenten | Algemene kennis | 203,220,678 boeken! | Bovenbalk: Altijd zichtbaar