Cantitate/Preț
Produs

Automata and Computability

De (autor)
Notă GoodReads:
en Limba Engleză Carte Hardback – 29 Jun 2007
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.
Citește tot Restrânge
Toate formatele și edițiile
Toate formatele și edițiile Preț Express
Carte Paperback (2) 27654 lei  Economic 5-7 săpt. +8111 lei  5-7 zile
  Springer – 15 May 2003 36221 lei  Economic 3-5 săpt.
  Springer – 13 Oct 2012 27654 lei  Economic 5-7 săpt. +8111 lei  5-7 zile
Carte Hardback (1) 28382 lei  Economic 15-27 zile +4773 lei  5-7 zile
  Springer – 29 Jun 2007 28382 lei  Economic 15-27 zile +4773 lei  5-7 zile

Preț: 28382 lei

Preț vechi: 28961 lei
-2%

Puncte Express: 426

Preț estimativ în valută:
5709 6405$ 5162£

Carte disponibilă

Livrare economică 02-14 august
Livrare express 23-25 iulie pentru 5772 lei

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9780387949079
ISBN-10: 0387949070
Pagini: 400
Ilustrații: 1
Dimensiuni: 155 x 235 x 32 mm
Greutate: 0.98 kg
Ediția: 1st. ed. 1997. Corr. 8th printing 2007
Editura: Springer
Colecția Springer
Locul publicării: New York, NY, United States

Public țintă

Lower undergraduate

Cuprins

Introduction * Finite Automata and Regular Sets * Pushdown Automata and Context-Free Languages * Turing Machines and Effective Computability * Homework Sets * Miscellaneous Exercises * Hints and Solutions

Caracteristici

Introduction to the basic theoretical models of computability, providing students who have already some experience with elementary discrete mathematics with a well-paced first course
A number of supplementary chapters introduce more advanced concepts, providing extension material for students keen to broaden their knowledge base
Plenty of exercises are provided, ranging from the easy to the challenging, enabling undergraduate students to test themselves at all levels of understanding