Résumé
students with an introduction to the basic theoretical models
of computability and to develop some of their rich and varied
structure. Students who already have some experience with elementary
discrete mathematics will find this a well-paced first course;
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 Godel'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.
Caractéristiques techniques
PAPIER | |
Éditeur(s) | Springer |
Auteur(s) | Dexter C. Kozen |
Parution | 10/04/1997 |
Nb. de pages | 400 |
Format | 18,5 x 24,3 |
Couverture | Relié |
Poids | 850g |
EAN13 | 9780387949079 |
Avantages Eyrolles.com
Consultez aussi
- Les meilleures ventes en Graphisme & Photo
- Les meilleures ventes en Informatique
- Les meilleures ventes en Construction
- Les meilleures ventes en Entreprise & Droit
- Les meilleures ventes en Sciences
- Les meilleures ventes en Littérature
- Les meilleures ventes en Arts & Loisirs
- Les meilleures ventes en Vie pratique
- Les meilleures ventes en Voyage et Tourisme
- Les meilleures ventes en BD et Jeunesse