SKU/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.20 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.
AR$261.542
55% OFF
AR$118.879

IMPORT EASILY

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

AR$261.542
55% OFF
AR$118.879
Llega en 12 a 18 días hábiles
con envío
Tienes garantía de entrega
Este producto viaja de USA a tus manos en