EUR 182,46
  • Precio final del producto
Envío GRATIS. Ver detalles
Sólo queda(n) 2 en stock (hay más unidades en camino).
Vendido y enviado por Amazon. Se puede envolver para regalo.
Automata, Computability a... se ha añadido a la cesta
¿Tienes uno para vender? Vender en Amazon
Volver atrás Ir adelante
Escuchar Reproduciendo... Interrumpido   Estás escuchando una muestra de la edición de audio Audible.
Más información
Ver las 3 imágenes

Automata, Computability and Complexity: Theory and Applications (Inglés) Tapa dura – 18 sep 2007


Ver los formatos y ediciones Ocultar otros formatos y ediciones
Precio Amazon
Nuevo desde Usado desde
Tapa dura
EUR 182,46
EUR 182,46 EUR 29,74
click to open popover

Descripción del producto

Reseña del editor

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.

Contraportada

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.

Ver Descripción del producto

No es necesario ningún dispositivo Kindle. Descárgate una de las apps de Kindle gratuitas para comenzar a leer libros Kindle en tu smartphone, tablet u ordenador.

  • Apple
  • Android
  • Windows Phone

Obtén la app gratuita:



Detalles del producto


Opiniones de clientes

No hay opiniones de clientes
Comparte tu opinión con otros clientes

Opiniones de clientes más útiles en Amazon.com

Amazon.com: 4,2 de 5 estrellas 10 opiniones
Edmon Begoli
5,0 de 5 estrellasGood Connection Between Practice and Theory, Pedagogical
8 de octubre de 2008 - Publicado en Amazon.com
Compra verificada
A 7 personas les ha parecido esto útil.
Technerd98
5,0 de 5 estrellasExactly the Same Contents as U.S. Version
23 de septiembre de 2017 - Publicado en Amazon.com
Compra verificada
Amazon Customer
5,0 de 5 estrellasA Lifesaver In Models Of Computation
29 de noviembre de 2011 - Publicado en Amazon.com
Compra verificada
A 4 personas les ha parecido esto útil.
Devang Joshi
5,0 de 5 estrellasgood book, good explanations
10 de febrero de 2012 - Publicado en Amazon.com
Compra verificada
Alex
5,0 de 5 estrellasA very helpful text
13 de julio de 2009 - Publicado en Amazon.com
A 10 personas les ha parecido esto útil.