Automata, Computability and Complexity by Elaine Rich INTERNATIONAL EDITION

Check-inStore
(698)
Angemeldet als gewerblicher Verkäufer
US $37,49
Ca.CHF 30,18
Artikelzustand:
Neu
2 verfügbar
Ganz entspannt. Rückgaben akzeptiert.
Versand:
US $4,99 (ca. CHF 4,02) FedEx International Economy from Abroad.
Standort: LUCKNOW, UTTAR PRADESH, Indien
Aufgrund von US-Zollbestimmungen muss der Käufer dieses Artikels vor der Lieferung Einfuhrgebühren an den Versanddienstleister entrichten. Mehr erfahren
Einfuhrgebühren:
Vor der Lieferung fällige Einfuhrgebühren
Lieferung:
Lieferung zwischen Do, 20. Nov und Fr, 21. Nov nach 94104 bei heutigem Zahlungseingang
Liefertermine - wird in neuem Fenster oder Tab geöffnet berücksichtigen die Bearbeitungszeit des Verkäufers, die PLZ des Artikelstandorts und des Zielorts sowie den Annahmezeitpunkt und sind abhängig vom gewählten Versandservice und dem ZahlungseingangZahlungseingang - wird ein neuem Fenster oder Tab geöffnet. Insbesondere während saisonaler Spitzenzeiten können die Lieferzeiten abweichen.
Rücknahme:
30 Tage Rückgabe. Käufer zahlt Rückversand. Wenn Sie ein eBay-Versandetikett verwenden, werden die Kosten dafür von Ihrer Rückerstattung abgezogen.
Zahlungen:
     Diners Club

Sicher einkaufen

eBay-Käuferschutz
Geld zurück, wenn etwas mit diesem Artikel nicht stimmt. Mehr erfahreneBay-Käuferschutz - wird in neuem Fenster oder Tab geöffnet
Der Verkäufer ist für dieses Angebot verantwortlich.
eBay-Artikelnr.:295371926152
Zuletzt aktualisiert am 18. Sep. 2025 08:45:08 MESZAlle Änderungen ansehenAlle Änderungen ansehen

Artikelmerkmale

Artikelzustand
Neu: Neues, ungelesenes, ungebrauchtes Buch in makellosem Zustand ohne fehlende oder beschädigte ...
Series
INTERNATIONAL EDITION PAPERBACK
Educational Level
Adult & Further Education
Features
International Edition
Level
Technical, Intermediate
ISBN
9780132288064
Kategorie

Über dieses Produkt

Product Identifiers

Publisher
Prentice Hall PTR
ISBN-10
0132288060
ISBN-13
9780132288064
eBay Product ID (ePID)
54346114

Product Key Features

Number of Pages
1120 Pages
Language
English
Publication Name
Automata, Computability and Complexity : Theory and Applications
Subject
Machine Theory, Information Theory
Publication Year
2007
Type
Textbook
Subject Area
Computers
Author
Elaine A. Rich
Format
Hardcover

Dimensions

Item Height
1.6 in
Item Weight
54 Oz
Item Length
9.5 in
Item Width
7.5 in

Additional Product Features

Intended Audience
College Audience
LCCN
2010-275411
Dewey Edition
22
Illustrated
Yes
Dewey Decimal
511.3
Synopsis
The theoretical underpinnings of computing form a standard part of almost every computer science curriculum. But the classic treatment of this material isolates it from the myriad ways in which the theory influences the design of modern hardware and software systems. The goal of this book is to change that. The book is organized into a core set of chapters (that cover the standard material suggested by the title), followed by a set of appendix chapters that highlight application areas including programming language design, compilers, software verification, networks, security, natural language processing, artificial intelligence, game playing, and computational biology. The core material includes discussions of finite state machines, Markov models, hidden Markov models (HMMs), regular expressions, context-free grammars, pushdown automata, Chomsky and Greibach normal forms, context-free parsing, pumping theorems for regular and context-free languages, closure theorems and decision procedures for regular and context-free languages, Turing machines, nondeterminism, decidability and undecidability, the Church-Turing thesis, reduction proofs, Post Correspondence problem, tiling problems, the undecidability of first-order logic, asymptotic dominance, time and space complexity, the Cook-Levin theorem, NP-completeness, Savitch's Theorem, time and space hierarchy theorems, randomized algorithms and heuristic search. Throughout the discussion of these topics there are pointers into the application chapters. So, for example, the chapter that describes reduction proofs of undecidability has a link to the security chapter, which shows a reduction proof of the undecidability of the safety of a simple protection framework. ", For upper level courses on Automata. Combining classic theory with unique applications, this crisp narrative is supported by abundant examples and clarifies key concepts by introducing important uses of techniques in real systems. Broad-ranging coverage allows instructors to easily customise course material to fit their unique requirements., The theoretical underpinnings of computing form a standard part of almost every computer science curriculum. But the classic treatment of this material isolates it from the myriad ways in which the theory influences the design of modern hardware and software systems. The goal of this book is to change that. The book is organized into a core set of chapters (that cover the standard material suggested by the title), followed by a set of appendix chapters that highlight application areas including programming language design, compilers, software verification, networks, security, natural language processing, artificial intelligence, game playing, and computational biology. The core material includes discussions of finite state machines, Markov models, hidden Markov models (HMMs), regular expressions, context-free grammars, pushdown automata, Chomsky and Greibach normal forms, context-free parsing, pumping theorems for regular and context-free languages, closure theorems and decision procedures for regular and context-free languages, Turing machines, nondeterminism, decidability and undecidability, the Church-Turing thesis, reduction proofs, Post Correspondence problem, tiling problems, the undecidability of first-order logic, asymptotic dominance, time and space complexity, the Cook-Levin theorem, NP-completeness, Savitch's Theorem, time and space hierarchy theorems, randomized algorithms and heuristic search. Throughout the discussion of these topics there are pointers into the application chapters. So, for example, the chapter that describes reduction proofs of undecidability has a link to the security chapter, which shows a reduction proof of the undecidability of the safety of a simple protection framework.
LC Classification Number
QA267

Artikelbeschreibung des Verkäufers

Info zu diesem Verkäufer

Check-inStore

95,3% positive Bewertungen8.2 Tsd. Artikel verkauft

Mitglied seit Mai 2018
Angemeldet als gewerblicher Verkäufer
Welcome, we are just a message away for any info you need 24X7..............DELIVERY DUTY PAID FOR US CUSTOMERSEXPRESS SHIPPING FOR USA CUSTOMERS with NO EXTRA COST.
Shop besuchenKontakt

Detaillierte Verkäuferbewertungen

Durchschnitt in den letzten 12 Monaten
Genaue Beschreibung
4.6
Angemessene Versandkosten
4.5
Lieferzeit
5.0
Kommunikation
4.6

Verkäuferbewertungen (820)

Alle Bewertungenselected
Positiv
Neutral
Negativ
  • -***o (3)- Bewertung vom Käufer.
    Letztes Jahr
    Bestätigter Kauf
    The textbook was in great condition and shipping was faster than expected. The value was amazing and I have no complaints. The text is authentic and official and the quality and appearance match those of others found in libraries and universities. The book came very protected and was wrapped in three different layers of protection and a carton box. I highly recommend this seller!
  • 6***a (19)- Bewertung vom Käufer.
    Letztes Jahr
    Bestätigter Kauf
    Came as advertised. Carefully packaged. Good value for money. Excellent service
  • c***o (158)- Bewertung vom Käufer.
    Letztes Jahr
    Bestätigter Kauf
    The item shipped quickly, was packaged well, and was exactly as described. A+ seller!