Automata, Computability and Complexity by Elaine Rich INTERNATIONAL EDITION

Check-inStore
(698)
Vendedor profesional
Registrado como vendedor profesional
USD37,49
Aproximadamente32,56 EUR
Estado:
Nuevo
2 disponibles
Respira tranquilidad. Se aceptan devoluciones.
Envío:
USD4,99 (aprox. 4,33 EUR) FedEx International Economy from Abroad.
Ubicado en: LUCKNOW, UTTAR PRADESH, India
Debido a las políticas de aduanas de EE. UU., el comprador de este artículo tendrá que pagar tarifas de importación al transportista antes de la entrega. Más información
Tarifas de importación:
Las tarifas de importación deben pagarse antes de la entrega
Entrega:
Entrega prevista entre el lun. 1 dic. y el mar. 2 dic. a 94104
Las fechas previstas de entrega (se abre en una nueva ventana o pestaña) incluyen el tiempo de manipulación del vendedor, el código postal de origen, el código postal de destino y la hora de aceptación, y dependen del servicio de envío seleccionado y de que el pago se haya hecho efectivoel pago se haya hecho efectivo (se abre en una nueva ventana o pestaña). Los plazos de entrega pueden variar, especialmente en épocas de mucha actividad.
Devoluciones:
30 días para devoluciones. El comprador paga el envío de la devolución..
Pagos:
    Diners Club

Compra con confianza

Garantía al cliente de eBay
Si no recibes el artículo que has pedido, te devolvemos el dinero. Más informaciónGarantía al cliente de eBay - se abre en una nueva ventana o pestaña
El vendedor asume toda la responsabilidad de este anuncio.
N.º de artículo de eBay:295371926152
Última actualización el 18 sep 2025 08:45:08 H.EspVer todas las actualizacionesVer todas las actualizaciones

Características del artículo

Estado
Nuevo: Libro nuevo, sin usar y sin leer, que está en perfecto estado; incluye todas las páginas sin ...
Series
INTERNATIONAL EDITION PAPERBACK
Educational Level
Adult & Further Education
Features
International Edition
Level
Technical, Intermediate
ISBN
9780132288064
Categoría

Acerca de este producto

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

Descripción del artículo del vendedor

Información de vendedor profesional

Certifico que todas mis actividades de venta cumplirán todas las leyes y reglamentos de la UE.

Acerca de este vendedor

Check-inStore

95% de votos positivos8,2 mil artículos vendidos

Se unió el may 2018
Registrado como vendedor profesional
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.
Visitar tiendaContactar

Valoraciones detalladas sobre el vendedor

Promedio durante los últimos 12 meses
Descripción precisa
4.6
Gastos de envío razonables
4.5
Rapidez de envío
5.0
Comunicación
4.6

Votos de vendedor (820)

Todas las valoracionesselected
Positivas
Neutras
Negativas
  • -***o (3)- Votos emitidos por el comprador.
    Último año
    Compra verificada
    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)- Votos emitidos por el comprador.
    Último año
    Compra verificada
    Came as advertised. Carefully packaged. Good value for money. Excellent service
  • c***o (158)- Votos emitidos por el comprador.
    Último año
    Compra verificada
    The item shipped quickly, was packaged well, and was exactly as described. A+ seller!