Artículo: AMZ-0387949070

Automata and Computability (Undergraduate Texts in Computer Science)

Format:

Hardcover

Hardcover

Kindle

Paperback

Detalles del producto
Disponibilidad
En stock
Peso con empaque
1.10 kg
Devolución
Condición
Nuevo
Producto de
Amazon
Viaja desde
USA

Sobre este producto
  • The aim of this textbook is to provide undergraduate students with an introduction to the basic theoretical models of computability, and to develop some of the model's rich and varied structure. Students who have already some experience with elementary discrete mathematics will find this a well-paced first course, and a number of supplementary chapters introduce more advanced concepts. The first part of the book is devoted to finite automata and their properties. Pushdown automata provide a broader class of models and enable the analysis of context-free languages. In the remaining chapters, Turing machines are introduced and the book culminates in discussions of effective computability, decidability, and Gödel's incompleteness theorems. Plenty of exercises are provided, ranging from the easy to the challenging. As a result, this text will make an ideal first course for students of computer science.
$157,17
49% OFF
$80,60

IMPORT EASILY

By purchasing this product you can deduct VAT with your RUT number

$157,17
49% OFF
$80,60

3 meses de gracia en diferidos y hasta 6 meses sin intereses con Pacificard

Envío gratis
Llega en 5 a 12 días hábiles
Con envío
Tienes garantia de entrega
Este producto viaja de USA a tus manos en